Sciweavers

109 search results - page 3 / 22
» Fast Prefix Search in Little Space, with Applications
Sort
View
ECIR
2003
Springer
13 years 7 months ago
Attaining Fast and Successful Searches in E-commerce Environments
Current online stores suffer from a cardinal problem. There are too many products to offer, and customers find themselves lost due to the vast selection. As opposed to traditional ...
Raz Lin, Sarit Kraus, Jeffrey D. Tew
ICCV
2007
IEEE
14 years 8 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas
ISSS
1997
IEEE
103views Hardware» more  ISSS 1997»
13 years 10 months ago
Fast and Extensive System-Level Memory Exploration for ATM Applications
In this paper, our memory architecture exploration methodology and CAD techniques for network protocol applications are presented. Prototype tools have been implemented, and appli...
Peter Slock, Sven Wuytack, Francky Catthoor, Gjalt...
ACMSE
2006
ACM
14 years 7 days ago
Inductive bases and their application to searches for minimal unary NFAs
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
Geoffrey Smith
GLVLSI
2003
IEEE
129views VLSI» more  GLVLSI 2003»
13 years 11 months ago
A system-level methodology for fast multi-objective design space exploration
In this paper, we address the problem of the efficient exploration of the architectural design space for parameterized systems. Since the design space is multi-objective, our aim ...
Gianluca Palermo, Cristina Silvano, S. Valsecchi, ...