Sciweavers

7006 search results - page 1046 / 1402
» Approximation Algorithms
Sort
View
IPSN
2007
Springer
16 years 26 days ago
Energy-optimized image communication on resource-constrained sensor platforms
Energy-efficient image communication is one of the most important goals for a large class of current and future sensor network applications. This paper presents a quantitative com...
Dong-U Lee, Hyungjin Kim, Steven Tu, Mohammad H. R...
MIRAGE
2007
Springer
16 years 26 days ago
Fitting Subdivision Surface Models to Noisy and Incomplete 3-D Data
Abstract. We describe an algorithm for fitting a Catmull-Clark subdivision surface model to an unstructured, incomplete and noisy data set. We complete the large missing data regi...
Spela Ivekovic, Emanuele Trucco
IPPS
2006
IEEE
16 years 23 days ago
Bio-sequence database scanning on a GPU
Protein sequences with unknown functionality are often compared to a set of known sequences to detect functional similarities. Efficient dynamic programming algorithms exist for t...
Weiguo Liu, Bertil Schmidt, Gerrit Voss, Adrian Sc...
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
16 years 23 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
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 1046 / 1402 Last » Next »