default search action
Beat Gfeller
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c17]Kevin Kilgour, Beat Gfeller, Qingqing Huang, Aren Jansen, Scott Wisdom, Marco Tagliasacchi:
Text-Driven Separation of Arbitrary Sounds. INTERSPEECH 2022: 5403-5407 - [i8]Kevin Kilgour, Beat Gfeller, Qingqing Huang, Aren Jansen, Scott Wisdom, Marco Tagliasacchi:
Text-Driven Separation of Arbitrary Sounds. CoRR abs/2204.05738 (2022) - 2021
- [c16]Beat Gfeller, Dominik Roblek, Marco Tagliasacchi:
One-Shot Conditional Audio Filtering of Arbitrary Sounds. ICASSP 2021: 501-505 - [c15]Zalán Borsos, Yunpeng Li, Beat Gfeller, Marco Tagliasacchi:
Micaugment: One-Shot Microphone Style Transfer. ICASSP 2021: 3400-3404 - 2020
- [j9]Marco Tagliasacchi
, Beat Gfeller, Felix de Chaumont Quitry, Dominik Roblek:
Pre-Training Audio Representations With Self-Supervision. IEEE Signal Process. Lett. 27: 600-604 (2020) - [j8]Beat Gfeller
SPICE: Self-Supervised Pitch Estimation. IEEE ACM Trans. Audio Speech Lang. Process. 28: 1118-1128 (2020) - [c14]Beat Gfeller, Christian Havnø Frank, Dominik Roblek, Matthew Sharifi, Marco Tagliasacchi, Mihajlo Velimirovic:
Pitch Estimation Via Self-Supervision. ICASSP 2020: 3527-3531 - [c13]Yunpeng Li, Marco Tagliasacchi, Beat Gfeller, Dominik Roblek:
Learning to Denoise Historical Music. ISMIR 2020: 504-511 - [i7]Yunpeng Li, Beat Gfeller, Marco Tagliasacchi, Dominik Roblek:
Learning to Denoise Historical Music. CoRR abs/2008.02027 (2020) - [i6]Aaqib Saeed, Victor Ungureanu, Beat Gfeller:
Sense and Learn: Self-Supervision for Omnipresent Sensors. CoRR abs/2009.13233 (2020) - [i5]Zalán Borsos, Yunpeng Li, Beat Gfeller, Marco Tagliasacchi:
MicAugment: One-shot Microphone Style Transfer. CoRR abs/2010.09658 (2020)
2010 – 2019
- 2019
- [i4]Marco Tagliasacchi, Beat Gfeller, Felix de Chaumont Quitry, Dominik Roblek:
Self-supervised audio representation learning for mobile devices. CoRR abs/1905.11796 (2019) - [i3]Beat Gfeller, Christian Havnø Frank, Dominik Roblek, Matthew Sharifi, Marco Tagliasacchi, Mihajlo Velimirovic:
SPICE: Self-supervised Pitch Estimation. CoRR abs/1910.11664 (2019) - 2017
- [i2]Blaise Agüera y Arcas, Beat Gfeller, Ruiqi Guo, Kevin Kilgour, Sanjiv Kumar, James Lyon, Julian Odell, Marvin Ritter, Dominik Roblek, Matthew Sharifi, Mihajlo Velimirovic:
Now Playing: Continuous low-power music recognition. CoRR abs/1711.10958 (2017) - 2016
- [c12]Beat Gfeller, Vlad Schogol, Keith B. Hall
Cross-lingual projection for class-based language models. ACL (2) 2016 - 2012
- [j7]Beat Gfeller:
Faster Swap Edge Computation in Minimum Diameter Spanning Trees. Algorithmica 62(1-2): 169-191 (2012) - 2011
- [j6]Remco M. Dijkman
Identifying refactoring opportunities in process model repositories. Inf. Softw. Technol. 53(9): 937-948 (2011) - [j5]Gerth Stølting Brodal
Towards optimal range medians. Theor. Comput. Sci. 412(24): 2588-2601 (2011) - [j4]Beat Gfeller, Nicola Santoro
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree. IEEE Trans. Dependable Secur. Comput. 8(1): 1-12 (2011) - [c11]Beat Gfeller, Hagen Völzer, Gunnar Wilmsmann:
Faster Or-Join Enactment for BPMN 2.0. BPMN 2011: 31-43 - [c10]Beat Gfeller:
Finding Longest Approximate Periodic Patterns. WADS 2011: 463-474 - 2010
- [j3]Shantanu Das, Beat Gfeller, Peter Widmayer:
Computing All Best Swaps for Minimum-Stretch Tree Spanners. J. Graph Algorithms Appl. 14(2): 287-306 (2010)
2000 – 2009
- 2009
- [j2]Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer:
Single machine batch scheduling with release times. J. Comb. Optim. 17(3): 323-338 (2009) - [c9]Beat Gfeller, Peter Sanders:
Towards Optimal Range Medians. ICALP (1) 2009: 475-486 - [i1]Beat Gfeller, Peter Sanders:
Towards Optimal Range Medians. CoRR abs/0901.1761 (2009) - 2008
- [j1]Beat Gfeller, Elias Vicari:
A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs. Ad Hoc Sens. Wirel. Networks 6(3-4): 197-213 (2008) - [c8]Beat Gfeller:
Faster Swap Edge Computation in Minimum Diameter Spanning Trees. ESA 2008: 454-465 - [c7]Shantanu Das, Beat Gfeller, Peter Widmayer:
Computing Best Swaps in Optimal Tree Spanners. ISAAC 2008: 716-727 - [c6]Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Angle Optimization in Target Tracking. SWAT 2008: 65-76 - 2007
- [c5]Beat Gfeller, Elias Vicari:
A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs. ADHOC-NOW 2007: 59-73 - [c4]Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Counting Targets with Mobile Sensors in an Unknown Environment. ALGOSENSORS 2007: 32-45 - [c3]Beat Gfeller, Elias Vicari:
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. PODC 2007: 53-60 - [c2]Beat Gfeller, Nicola Santoro
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree. DISC 2007: 268-282 - 2006
- [c1]Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer:
Online Single Machine Batch Scheduling. MFCS 2006: 424-435
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: