Sciweavers

1322 search results - page 160 / 265
» Efficient Goal-Directed Exploration
Sort
View
CVPR
2008
IEEE
16 years 5 months ago
Context-aware clustering
Most existing methods of semi-supervised clustering introduce supervision from outside, e.g., manually label some data samples or introduce constrains into clustering results. Thi...
Junsong Yuan, Ying Wu
ICCV
2007
IEEE
16 years 5 months ago
Half Quadratic Analysis for Mean Shift: with Extension to A Sequential Data Mode-Seeking Method
Theoretical understanding and extension of mean shift procedure has received much attention recently [8, 18, 3]. In this paper, we present a theoretical exploration and an algorit...
Xiaotong Yuan, Stan Z. Li
ECCV
2004
Springer
16 years 5 months ago
Recognition by Probabilistic Hypothesis Construction
We present a probabilistic framework for recognizing objects in images of cluttered scenes. Hundreds of objects may be considered and searched in parallel. Each object is learned f...
Pierre Moreels, Michael Maire, Pietro Perona
ICDE
2009
IEEE
136views Database» more  ICDE 2009»
16 years 5 months ago
A Concise Representation of Range Queries
Abstract--With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones...
Ke Yi, Xiang Lian, Feifei Li, Lei Chen 0002
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
16 years 5 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou