Sciweavers

2498 search results - page 65 / 500
» Data Structures with Unpredictable Timing
Sort
View
ICML
2000
IEEE
15 years 10 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
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 8 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
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
15 years 3 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
ESOA
2006
15 years 1 months ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...
DASFAA
2007
IEEE
147views Database» more  DASFAA 2007»
15 years 4 months ago
OntoDB: It Is Time to Embed Your Domain Ontology in Your Database
Abstract. This demonstration presents OntoDB, a prototype that allows to store explicitly in the database not only the data, but also the conceptual model defining the structure o...
Stéphane Jean, Dehainsala Hondjack, Dung Ng...