Sciweavers

4009 search results - page 291 / 802
» Clustering on Complex Graphs
Sort
View
CGF
2010
171views more  CGF 2010»
15 years 3 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
ICDAR
2011
IEEE
14 years 6 months ago
Chinese Keyword Spotting Using Knowledge-Based Clustering
—Content-based document image retrieval is a new and promising research area. Without OCR, document indexing directly based on image content is more general and convenient. Howev...
Yong Xia, Kuanquan Wang, Mingwei Li
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 7 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
16 years 6 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
CP
2006
Springer
15 years 10 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider