Sciweavers

3255 search results - page 101 / 651
» Clustering moving objects
Sort
View
ICPR
2006
IEEE
15 years 11 months ago
Bayesian Feedback in Data Clustering
In many clustering applications, the user has some vague notion of the number and membership of the desired clusters. However, it is difficult for the user to provide such knowled...
Anil K. Jain, Pavan Kumar Mallapragada, Martin H. ...
INFORMATICALT
2008
124views more  INFORMATICALT 2008»
14 years 10 months ago
Hierarchical Adaptive Clustering
This paper studies an adaptive clustering problem. We focus on re-clustering an object set, previously clustered, when the feature set characterizing the objects increases. We prop...
Gabriela Serban, Alina Campan
ICCAD
1994
IEEE
101views Hardware» more  ICCAD 1994»
15 years 2 months ago
A general framework for vertex orderings, with applications to netlist clustering
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
Charles J. Alpert, Andrew B. Kahng
DAGM
2008
Springer
14 years 11 months ago
Boosting for Model-Based Data Clustering
In this paper a novel and generic approach for model-based data clustering in a boosting framework is presented. This method uses the forward stagewise additive modeling to learn t...
Amir Saffari, Horst Bischof
PAMI
2010
139views more  PAMI 2010»
14 years 8 months ago
Order-Preserving Moves for Graph-Cut-Based Optimization
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu