Sciweavers

403 search results - page 75 / 81
» Flexible Data Searchs using Condition Formulas
Sort
View
119
Voted
RAS
2000
106views more  RAS 2000»
15 years 3 months ago
Robust localization of auditory and visual targets in a robotic barn owl
In the last two decades, the barn owl, a nocturnal predator with accurate visual and auditory capabilities, has become a common experimental system for neuroscientists investigati...
Michele Rucci, Jonathan Wray, Gerald M. Edelman
250
Voted
ICDE
1999
IEEE
143views Database» more  ICDE 1999»
16 years 5 months ago
Query Routing in Large-Scale Digital Library Systems
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the inc...
Ling Liu
152
Voted
CVPR
2010
IEEE
15 years 11 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik
107
Voted
SAC
2004
ACM
15 years 9 months ago
A parallel algorithm for the extraction of structured motifs
In this work we propose a parallel algorithm for the efficient extraction of binding-site consensus from genomic sequences. This algorithm, based on an existing approach, extracts...
Alexandra M. Carvalho, Arlindo L. Oliveira, Ana T....
106
Voted
WAIM
2004
Springer
15 years 9 months ago
Learning-Based Top-N Selection Query Evaluation over Relational Databases
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
Liang Zhu, Weiyi Meng