Sciweavers

3223 search results - page 129 / 645
» The Scaling of Search Cost
Sort
View
IPPS
1997
IEEE
15 years 10 months ago
A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
Smaïl Niar, Arnaud Fréville
FGR
2008
IEEE
147views Biometrics» more  FGR 2008»
16 years 27 days ago
Unsupervised clustering for google searches of celebrity images
How do we identify images of the same person in photo albums? How can we find images of a particular celebrity using web image search engines? These types of tasks require solvin...
Alex Holub, Pierre Moreels, Pietro Perona
CORR
2010
Springer
64views Education» more  CORR 2010»
15 years 6 months ago
A Trustability Metric for Code Search based on Developer Karma
The promise of search-driven development is that developers will save time and resources by reusing external code in their local projects. To efficiently integrate this code, user...
Florian S. Gysin, Adrian Kuhn
PERVASIVE
2008
Springer
15 years 6 months ago
Microsearch: When Search Engines Meet Small Devices
Abstract. In this paper, we present Microsearch, a search system suitable for small devices used in ubiquitous computing environments. Akin to a desktop search engine, Microsearch ...
Chiu Chiang Tan, Bo Sheng, Haodong Wang, Qun Li
ICCV
2009
IEEE
16 years 11 months ago
Feature-Centric Efficient Subwindow Search
embedded in a sliding-window scheme. Such exhaustive search involves massive computation. Efficient Subwindow Search (ESS) [11] avoids this by means of branch and bound. However...
Alain Lehmann, Bastian Leibe, Luc van Gool