Sciweavers

5 search results - page 1 / 1
» Practical Entropy-Bounded Schemes for O(1)-Range Minimum Que...
Sort
View
DCC
2008
IEEE
14 years 4 months ago
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
Johannes Fischer, Volker Heun, Horst Martin St&uum...
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
13 years 11 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
AIRS
2005
Springer
13 years 10 months ago
Query Expansion with the Minimum Relevance Judgments
Query expansion techniques generally select new query terms from a set of top ranked documents. Although a user’s manual judgment of those documents would much help to select goo...
Masayuki Okabe, Kyoji Umemura, Seiji Yamada
SIGMOD
2009
ACM
214views Database» more  SIGMOD 2009»
14 years 4 months ago
DDE: from dewey to a fully dynamic XML labeling scheme
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...
Liang Xu, Tok Wang Ling, Huayu Wu, Zhifeng Bao
MONET
2007
111views more  MONET 2007»
13 years 4 months ago
Resource Discovery in Activity-Based Sensor Networks
— This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level conc...
Doina Bucur, Jakob E. Bardram