Sciweavers

16430 search results - page 928 / 3286
» On Computable Tree Functions
Sort
View
PRL
2006
96views more  PRL 2006»
15 years 7 months ago
Fast codebook search algorithms based on tree-structured vector quantization
Tree-Structured Vector Quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the sel...
Chin-Chen Chang, Yu-Chiang Li, Jun-Bin Yeh
ASPLOS
2012
ACM
14 years 3 months ago
An update-aware storage system for low-locality update-intensive workloads
Traditional storage systems provide a simple read/write interface, which is inadequate for low-locality update-intensive workloads because it limits the disk scheduling flexibili...
Dilip Nijagal Simha, Maohua Lu, Tzi-cker Chiueh
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
16 years 7 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
16 years 7 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
WWW
2010
ACM
16 years 2 months ago
A pattern tree-based approach to learning URL normalization rules
Duplicate URLs have brought serious troubles to the whole pipeline of a search engine, from crawling, indexing, to result serving. URL normalization is to transform duplicate URLs...
Tao Lei, Rui Cai, Jiang-Ming Yang, Yan Ke, Xiaodon...