Sciweavers

172 search results - page 15 / 35
» On the cost of searching signature trees
Sort
View
CCGRID
2009
IEEE
14 years 2 months ago
Multicast Trees for Collaborative Applications
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
Krzysztof Rzadca, Jackson Tan Teck Yong, Anwitaman...
ICDE
2000
IEEE
144views Database» more  ICDE 2000»
14 years 9 months ago
Power Conservative Multi-Attribute Queries on Data Broadcast
In this paper, we study power conservation techniques for multi-attribute queries on wireless data broadcast channels. Indexing data on broadcast channels can improve client filte...
Qinglong Hu, Wang-Chien Lee, Dik Lun Lee
ICML
2005
IEEE
14 years 8 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
14 years 2 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
ADC
2008
Springer
135views Database» more  ADC 2008»
14 years 1 months ago
Faster Path Indexes for Search in XML Data
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
Nils Grimsmo