Sciweavers

1274 search results - page 180 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
16 years 25 days 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
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
16 years 17 days ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
SI3D
2005
ACM
16 years 2 days ago
Reducing blendshape interference by selected motion attenuation
Blendshapes (linear shape interpolation models) are perhaps the most commonly employed technique in facial animation practice. A major problem in creating blendshape animation is ...
John P. Lewis, Jonathan Mooser, Zhigang Deng, Ulri...
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 12 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 8 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson