Beat Gfeller

According to our database1, Beat Gfeller authored at least 21 papers between 2006 and 2017.

Collaborative distances :

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Now Playing: Continuous low-power music recognition.
CoRR, 2017

2016
Cross-lingual projection for class-based language models.
Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics, 2016

2012
Faster Swap Edge Computation in Minimum Diameter Spanning Trees.
Algorithmica, 2012

2011
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree.
IEEE Trans. Dependable Sec. Comput., 2011

Towards optimal range medians.
Theor. Comput. Sci., 2011

Identifying refactoring opportunities in process model repositories.
Information & Software Technology, 2011

Finding Longest Approximate Periodic Patterns.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Faster Or-Join Enactment for BPMN 2.0.
Proceedings of the Business Process Model and Notation - Third International Workshop, 2011

2010
Computing All Best Swaps for Minimum-Stretch Tree Spanners.
J. Graph Algorithms Appl., 2010

2009
Single machine batch scheduling with release times.
J. Comb. Optim., 2009

Towards Optimal Range Medians
CoRR, 2009

Towards Optimal Range Medians.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008
A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs.
Ad Hoc & Sensor Wireless Networks, 2008

Angle Optimization in Target Tracking.
Proceedings of the Algorithm Theory, 2008

Computing Best Swaps in Optimal Tree Spanners.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Faster Swap Edge Computation in Minimum Diameter Spanning Trees.
Proceedings of the Algorithms, 2008

2007
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Counting Targets with Mobile Sensors in an Unknown Environment.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 6th International Conference, 2007

2006
Online Single Machine Batch Scheduling.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006


  Loading...