Sciweavers

779 search results - page 122 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Object retrieval with large vocabularies and fast spatial matching
In this paper, we present a large-scale object retrieval system. The user supplies a query object by selecting a region of a query image, and the system returns a ranked list of i...
James Philbin, Ondrej Chum, Michael Isard, Josef S...
SIGMOD
2004
ACM
188views Database» more  SIGMOD 2004»
14 years 7 months ago
Online Event-driven Subsequence Matching over Financial Data Streams
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
Huanmei Wu, Betty Salzberg, Donghui Zhang
WADS
2001
Springer
137views Algorithms» more  WADS 2001»
13 years 11 months ago
Visual Ranking of Link Structures
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...
Ulrik Brandes, Sabine Cornelsen
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
14 years 28 days ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
EH
1999
IEEE
141views Hardware» more  EH 1999»
13 years 11 months ago
On-Line Evolution of FPGA-Based Circuits: A Case Study on Hash Functions
An evolutionary algorithm is used to evolve a digital circuit which computes a simple hash function mapping a 16bit address space into an 8-bit one. The target technology is FPGA,...
Ernesto Damiani, Andrea Tettamanzi, Valentino Libe...