Sciweavers

621 search results - page 10 / 125
» Global partial orders from sequential data
Sort
View
SETN
2004
Springer
15 years 3 months ago
Incremental Mixture Learning for Clustering Discrete Data
Abstract. This paper elaborates on an efficient approach for clustering discrete data by incrementally building multinomial mixture models through likelihood maximization using the...
Konstantinos Blekas, Aristidis Likas
KDD
2006
ACM
166views Data Mining» more  KDD 2006»
15 years 10 months ago
Anonymizing sequential releases
An organization makes a new release as new information become available, releases a tailored view for each data request, releases sensitive information and identifying information...
Ke Wang, Benjamin C. M. Fung
66
Voted
IROS
2009
IEEE
118views Robotics» more  IROS 2009»
15 years 4 months ago
Data-driven grasping with partial sensor data
— To grasp a novel object, we can index it into a database of known 3D models and use precomputed grasp data for those models to suggest a new grasp. We refer to this idea as dat...
Corey Goldfeder, Matei T. Ciocarlie, Jaime Peretzm...
PAMI
2012
13 years 2 days ago
Detachable Object Detection: Segmentation and Depth Ordering from Short-Baseline Video
—We describe an approach for segmenting a moving image into regions that correspond to surfaces in the scene that are partially surrounded by the medium. It integrates both appea...
Alper Ayvaci, Stefano Soatto
TCS
2008
14 years 9 months ago
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
Anne Berry, Elias Dahlhaus, Pinar Heggernes, Genev...