Sciweavers

2600 search results - page 101 / 520
» Clustering with or without the Approximation
Sort
View
ICCV
2007
IEEE
16 years 3 months ago
Mode-seeking by Medoidshifts
We present a nonparametric mode-seeking algorithm, called medoidshift, based on approximating the local gradient using a weighted estimate of medoids. Like meanshift, medoidshift ...
Yaser Sheikh, Erum A. Khan, Takeo Kanade
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 1 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
ICCD
2000
IEEE
87views Hardware» more  ICCD 2000»
15 years 6 months ago
Binary and Multi-Valued SPFD-Based Wire Removal in PLA Networks
This paper describes the application of binary and multivalued SPFD-based wire removal techniques for circuit implementations utilizing networks of PLAs. It has been shown that a ...
Subarnarekha Sinha, Sunil P. Khatri, Robert K. Bra...
SC
2005
ACM
15 years 7 months ago
Performance-constrained Distributed DVS Scheduling for Scientific Applications on Power-aware Clusters
Left unchecked, the fundamental drive to increase peak performance using tens of thousands of power hungry components will lead to intolerable operating costs and failure rates. H...
Rong Ge, Xizhou Feng, Kirk W. Cameron
DIAL
2006
IEEE
167views Image Analysis» more  DIAL 2006»
15 years 7 months ago
Tree clustering for layout-based document image retrieval
We describe a system for the retrieval on the basis of layout similarity of document images belonging to collections stored in digital libraries. Layout regions are extracted and ...
Simone Marinai, Emanuele Marino, Giovanni Soda