Sciweavers

1381 search results - page 240 / 277
» Structural signatures for tree data structures
Sort
View
SIGMOD
2006
ACM
426views Database» more  SIGMOD 2006»
14 years 7 months ago
Effective keyword search in relational databases
With the amount of available text data in relational databases growing rapidly, the need for ordinary users to search such information is dramatically increasing. Even though the ...
Fang Liu, Clement T. Yu, Weiyi Meng, Abdur Chowdhu...
ICEIS
2009
IEEE
14 years 2 months ago
Semi-supervised Information Extraction from Variable-length Web-page Lists
We propose two methods for constructing automated programs for extraction of information from a class of web pages that are very common and of high practical significance - varia...
Daniel Nikovski, Alan Esenther, Akihiro Baba
DEXA
2009
Springer
127views Database» more  DEXA 2009»
14 years 2 months ago
The Real Performance Drivers behind XML Lock Protocols
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
Sebastian Bächle, Theo Härder
JCNS
2000
120views more  JCNS 2000»
13 years 7 months ago
Robust Spectrotemporal Reverse Correlation for the Auditory System: Optimizing Stimulus Design
Abstract. The spectrotemporal receptive field (STRF) is a functional descriptor of the linear processing of timevarying acoustic spectra by the auditory system. By cross-correlatin...
David J. Klein, Didier A. Depireux, Jonathan Z. Si...
SPIRE
2009
Springer
14 years 2 months ago
On Entropy-Compressed Text Indexing in External Memory
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Je...