Sciweavers

4860 search results - page 475 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
GLOBECOM
2006
IEEE
15 years 10 months ago
Optimal Routing in the Worst-Case-Error Metric
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
Edwin Soedarmadji
126
Voted
ICRA
2005
IEEE
121views Robotics» more  ICRA 2005»
15 years 9 months ago
Distributed Sampling-Based Roadmap of Trees for Large-Scale Motion Planning
Abstract— High-dimensional problems arising from complex robotic systems test the limits of current motion planners and require the development of efficient distributed motion p...
Erion Plaku, Lydia E. Kavraki
116
Voted
VLDB
2005
ACM
86views Database» more  VLDB 2005»
15 years 9 months ago
One-Pass Wavelet Synopses for Maximum-Error Metrics
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
Panagiotis Karras, Nikos Mamoulis
171
Voted
AMDO
2004
Springer
15 years 9 months ago
Image Cues Fusion for Object Tracking Based on Particle Filter
Particle filter is a powerful algorithm to deal with non-linear and non-Gaussian tracking problems. However the algorithm relying only upon one image cue often fails in challengin...
Peihua Li, François Chaumette
FSTTCS
2004
Springer
15 years 9 months ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala