Sciweavers

2434 search results - page 184 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
AUTOMATICA
2006
140views more  AUTOMATICA 2006»
15 years 6 months ago
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
Vijay Gupta, Timothy H. Chung, Babak Hassibi, Rich...
DCG
2000
104views more  DCG 2000»
15 years 6 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
16 years 11 months ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh
ICML
2007
IEEE
16 years 7 months ago
Neighbor search with global geometry: a minimax message passing algorithm
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
Kye-Hyeon Kim, Seungjin Choi
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
15 years 11 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka