Sciweavers

4860 search results - page 276 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
77
Voted
COMPGEOM
2006
ACM
15 years 6 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
78
Voted
CEC
2010
IEEE
15 years 1 months ago
Global search for occlusion minimisation in virtual camera control
Abstract-- This paper presents a fast and reliable globalsearch approach to the problem of virtual camera positioning when multiple objects that need to be within the reach of the ...
Paolo Burelli, Georgios N. Yannakakis
178
Voted
GIS
2004
ACM
16 years 1 months ago
Algorithms for the placement of diagrams on maps
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...
Étienne Schramm, Alexander Wolff, Marc J. v...
90
Voted
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
15 years 6 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
15 years 7 months ago
MRBUG: A Competitive Multi-Robot Path Finding Algorithm
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
Shahar Sarid, Amir Shapiro, Yoav Gabriely