Sciweavers

1368 search results - page 34 / 274
» Avoiding Simplicity Is Complex
Sort
View
COMPGEOM
2006
ACM
14 years 3 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
ANTS
2004
Springer
149views Algorithms» more  ANTS 2004»
14 years 3 months ago
A Binary Recursive Gcd Algorithm
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
Damien Stehlé, Paul Zimmermann
FGR
2004
IEEE
167views Biometrics» more  FGR 2004»
14 years 1 months ago
Gesture Recognition Using Laser-Based Tracking System
This paper describes a finger gesture recognition system based on an active tracking mechanism. The simplicity of this tracking system is such that it would be possible to integra...
Stéphane Perrin, Álvaro Cassinelli, ...
CCCG
2010
13 years 11 months ago
Computing straight skeletons of planar straight-line graphs based on motorcycle graphs
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
Stefan Huber, Martin Held
WOTUG
2008
13 years 11 months ago
Solving the Santa Claus Problem: a Comparison of Various Concurrent Programming Techniques
Abstract. The Santa Claus problem provides an excellent exercise in concurrent programming and can be used to show the simplicity or complexity of solving problems using a particul...
Jason Hurt, Jan Bækgaard Pedersen