Sciweavers

1396 search results - page 20 / 280
» Succinct Dynamic Data Structures
Sort
View
ICML
2000
IEEE
16 years 3 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
127
Voted
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 1 months ago
Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
Fangwen Fu, Mihaela van der Schaar
155
Voted
SIGIR
2012
ACM
13 years 5 months ago
Optimizing positional index structures for versioned document collections
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
Jinru He, Torsten Suel
124
Voted
ICML
2007
IEEE
16 years 3 months ago
Dynamic hierarchical Markov random fields and their application to web data extraction
Hierarchical models have been extensively studied in various domains. However, existing models assume fixed model structures or incorporate structural uncertainty generatively. In...
Jun Zhu, Zaiqing Nie, Bo Zhang, Ji-Rong Wen
105
Voted
ISPDC
2006
IEEE
15 years 8 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun