Sciweavers

461 search results - page 21 / 93
» Splitting NP-Complete Sets
Sort
View
ECCV
2006
Springer
15 years 24 days ago
Level-Set Curve Particles
In many applications it is necessary to track a moving and deforming boundary on the plane from infrequent, sparse measurements. For instance, each of a set of mobile observers may...
Tingting Jiang, Carlo Tomasi
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
13 years 8 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
ICASSP
2011
IEEE
13 years 2 months ago
Random finite set for data association in multiple camera tracking
Most methods for multiple camera tracking rely on accurate calibration to associate data from multiple cameras. However, it often is not easy to have an accurate calibration in so...
Nam Trung Pham, Richard Chang, Karianto Leman, Tec...
MEMICS
2010
13 years 5 months ago
Simultaneous Tracking of Multiple Objects Using Fast Level Set-Like Algorithm
A topological flexibility of implicit active contours is of great benefit, since it allows simultaneous detection of several objects without any a priori knowledge about their num...
Martin Maska, Pavel Matula, Michal Kozubek
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 11 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer