Sciweavers

7930 search results - page 1218 / 1586
» Greedy in Approximation Algorithms
Sort
View
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
16 years 22 days ago
Landmark Selection for Task-Oriented Navigation
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni
SMA
2006
ACM
120views Solid Modeling» more  SMA 2006»
16 years 20 days ago
Identifying flat and tubular regions of a shape by unstable manifolds
We present an algorithm to identify the flat and tubular regions of a three dimensional shape from its point sample. We consider the distance function to the input point cloud an...
Samrat Goswami, Tamal K. Dey, Chandrajit L. Bajaj
IPPS
2005
IEEE
16 years 9 days ago
Bootstrapping Free-Space Optical Networks
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
Fang Liu, Uzi Vishkin, Stuart Milner
MOBIQUITOUS
2005
IEEE
16 years 9 days ago
Multi-Constraint Dynamic Access Selection in Always Best Connected Networks
Abstract— In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in ...
Bo Xing, Nalini Venkatasubramanian
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
16 years 8 days ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek
« Prev « First page 1218 / 1586 Last » Next »