Sciweavers

2260 search results - page 221 / 452
» A new algorithm for clustering search results
Sort
View
JMLR
2002
102views more  JMLR 2002»
15 years 6 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering
WIDM
2009
ACM
16 years 1 months ago
Distinct nearest neighbors queries for similarity search in very large multimedia databases
As the volume of multimedia data available on internet is tremendously increasing, the content-based similarity search becomes a popular approach to multimedia retrieval. The most...
Tomás Skopal, Vlastislav Dohnal, Michal Bat...
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
13 years 9 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
DAC
1994
ACM
15 years 10 months ago
Dynamic Search-Space Pruning Techniques in Path Sensitization
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
João P. Marques Silva, Karem A. Sakallah
CVPR
2010
IEEE
15 years 8 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...