Sciweavers

154 search results - page 17 / 31
» Space efficient dynamic stabbing with fast queries
Sort
View
SBCCI
2003
ACM
135views VLSI» more  SBCCI 2003»
14 years 3 months ago
Modeling a Reconfigurable System for Computing the FFT in Place via Rewriting-Logic
The growing adoption of reconfigurable architectures opens new implementation alternatives and creates new design challenges. In the case of dynamically reconfigurable architectur...
Mauricio Ayala-Rincón, Rodrigo B. Nogueira,...
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 10 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
CIKM
2008
Springer
14 years 11 days ago
Dynamic faceted search for discovery-driven analysis
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia...
CIVR
2008
Springer
165views Image Analysis» more  CIVR 2008»
14 years 6 days ago
Balancing thread based navigation for targeted video search
Various query methods for video search exist. Because of the semantic gap each method has its limitations. We argue that for effective retrieval query methods need to be combined ...
Ork de Rooij, Cees G. M. Snoek, Marcel Worring
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 4 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner