Sciweavers

2107 search results - page 235 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
CIKM
2006
Springer
14 years 1 months ago
Evaluation by comparing result sets in context
Familiar evaluation methodologies for information retrieval (IR) are not well suited to the task of comparing systems in many real settings. These systems and evaluation methods m...
Paul Thomas, David Hawking
TEC
2002
81views more  TEC 2002»
13 years 9 months ago
Genetic object recognition using combinations of views
We investigate the application of genetic algorithms (GAs) for recognizing real two-dimensional (2-D) or three-dimensional (3-D) objects from 2-D intensity images, assuming that th...
George Bebis, Evangelos A. Yfantis, Sushil J. Loui...
ECCV
2010
Springer
14 years 2 months ago
Convex Relaxation for Multilabel Problems with Product Label Spaces
Convex relaxations for continuous multilabel problems have attracted a lot of interest recently [1–5]. Unfortunately, in previous methods, the runtime and memory requirements sca...
HIPC
2009
Springer
13 years 7 months ago
Three scalable approaches to improving many-core throughput for a given peak power budget
Recently proposed techniques for peak power management [18] involve centralized decisionmaking and assume quick evaluation of the various power management states. These techniques...
John Sartori, Rakesh Kumar
AINA
2007
IEEE
14 years 3 months ago
DHTs over Peer Clusters for Distributed Information Retrieval
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
Odysseas Papapetrou, Wolf Siberski, Wolf-Tilo Balk...