Sciweavers

4095 search results - page 313 / 819
» How to test a tree
Sort
View
WWW
2005
ACM
16 years 1 months ago
Thresher: automating the unwrapping of semantic content from the World Wide Web
We describe Thresher, a system that lets non-technical users teach their browsers how to extract semantic web content from HTML documents on the World Wide Web. Users specify exam...
Andrew Hogue, David R. Karger
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
16 years 29 days ago
SHIFT-SPLIT: I/O Efficient Maintenance of Wavelet-Transformed Multidimensional Data
The Discrete Wavelet Transform is a proven tool for a wide range of database applications. However, despite broad acceptance, some of its properties have not been fully explored a...
Mehrdad Jahangiri, Dimitris Sacharidis, Cyrus Shah...
INFOCOM
2008
IEEE
15 years 7 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
103
Voted
ADBIS
2005
Springer
163views Database» more  ADBIS 2005»
15 years 6 months ago
XML Databases and Beyond - Plenty of Architectural Challenges Ahead
A key observation is that the invariants in database management determine the mapping steps of the supporting architecture. Referring to the multi-layered architecture of record-or...
Theo Härder
100
Voted
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
15 years 6 months ago
Approximating the Bandwidth of Caterpillars
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
Uriel Feige, Kunal Talwar