Sciweavers

89 search results - page 14 / 18
» Efficient Aggregation of Ranked Inputs
Sort
View
DIS
2008
Springer
14 years 11 months ago
Unsupervised Classifier Selection Based on Two-Sample Test
We propose a well-founded method of ranking a pool of m trained classifiers by their suitability for the current input of n instances. It can be used when dynamically selecting a s...
Timo Aho, Tapio Elomaa, Jussi Kujala
CVPR
2006
IEEE
15 years 11 months ago
Unsupervised Learning of Categories from Sets of Partially Matching Image Features
We present a method to automatically learn object categories from unlabeled images. Each image is represented by an unordered set of local features, and all sets are embedded into...
Kristen Grauman, Trevor Darrell
CVPR
2006
IEEE
15 years 11 months ago
Shape Topics: A Compact Representation and New Algorithms for 3D Partial Shape Retrieval
This paper develops an efficient new method for 3D partial shape retrieval. First, a Monte Carlo sampling strategy is employed to extract local shape signatures from each 3D model...
Yi Liu, Hongbin Zha, Hong Qin
DAC
2005
ACM
15 years 10 months ago
Power emulation: a new paradigm for power estimation
In this work, we propose a new paradigm called power emulation, which exploits hardware acceleration to drastically speedup power estimation. Power emulation is based on the obser...
Joel Coburn, Srivaths Ravi, Anand Raghunathan
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 1 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson