Sciweavers

2152 search results - page 315 / 431
» A Comparative Study of 2QBF Algorithms
Sort
View
CVPR
2010
IEEE
16 years 1 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
EDBT
2010
ACM
116views Database» more  EDBT 2010»
15 years 11 months ago
HARRA: fast iterative hashed record linkage for large-scale data collections
We study the performance issue of the “iterative” record linkage (RL) problem, where match and merge operations may occur together in iterations until convergence emerges. We ...
Hung-sik Kim, Dongwon Lee
WSDM
2009
ACM
131views Data Mining» more  WSDM 2009»
15 years 11 months ago
Diversifying search results
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...
ICRA
2009
IEEE
145views Robotics» more  ICRA 2009»
15 years 11 months ago
Distributed maximum a posteriori estimation for multi-robot cooperative localization
— This paper presents a distributed Maximum A Posteriori (MAP) estimator for multi-robot Cooperative Localization (CL). As opposed to centralized MAP-based CL, the proposed algor...
Esha D. Nerurkar, Stergios I. Roumeliotis, Agostin...
CIDM
2007
IEEE
15 years 11 months ago
Scalable Clustering for Large High-Dimensional Data Based on Data Summarization
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulk...