Sciweavers

498 search results - page 60 / 100
» Measuring the Complexity of Polygonal Objects
Sort
View
GLOBECOM
2006
IEEE
14 years 5 months ago
Sensor Localization from WLS Optimization with Closed-form Gradient and Hessian
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
Giuseppe Destino, Giuseppe Thadeu Freitas de Abreu
CAISE
2006
Springer
14 years 2 months ago
Enhancing trust and buy-in from business: a platform for business -driven development of B2B transactions
A measure for the quality of software is the extent to which it corresponds to the business objectives and requirements it was designed for. The earlier those who elicit the requir...
Michael Schmitt, Bertrand Grégoire, Stefan ...
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
14 years 2 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
ICRA
2009
IEEE
175views Robotics» more  ICRA 2009»
13 years 8 months ago
A combination of particle filtering and deterministic approaches for multiple kernel tracking
Color-based tracking methods have proved to be efficient for their robustness qualities. The drawback of such global representation of an object is the lack of information on its s...
Céline Teuliere, Éric Marchand, Laur...
CVPR
2006
IEEE
15 years 29 days ago
Dynamics Based Robust Motion Segmentation
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
Roberto Lublinerman, Mario Sznaier, Octavia I. Cam...