Sciweavers

1381 search results - page 101 / 277
» Structural signatures for tree data structures
Sort
View
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
15 years 10 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 ...
AAAI
2007
15 years 6 days ago
Recognizing Textual Entailment Using a Subsequence Kernel Method
We present a novel approach to recognizing Textual nt. Structural features are constructed from abstract tree descriptions, which are automatically extracted from syntactic depend...
Rui Wang 0005, Günter Neumann
INFOCOM
2010
IEEE
14 years 8 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
GSN
2009
Springer
155views Sensor Networks» more  GSN 2009»
15 years 1 months ago
Distributed Network Configuration for Wavelet-Based Compression in Sensor Networks
En-route data compression is fundamental to reduce the power consumed for data gathering in sensor networks. Typical in-network compression schemes involve the distributed computat...
Paula Tarrío, Giuseppe Valenzise, Godwin Sh...
VISUALIZATION
1996
IEEE
15 years 2 months ago
Real-Time Incremental Visualization of Dynamic Ultrasound Volumes Using Parallel BSP Trees
We present a method for producing real-time volume visualizations of continuously captured, arbitrarily-oriented 2D arrays (slices) of data. Our system constructs a 3D representat...
William F. Garrett, Henry Fuchs, Mary C. Whitton, ...