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...
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...
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...
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 ...
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...