Sciweavers

344 search results - page 45 / 69
» Streaming Algorithms for extent problems in high dimensions
Sort
View
CN
1998
64views more  CN 1998»
15 years 1 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
DAGM
2010
Springer
15 years 2 months ago
Gaussian Mixture Modeling with Gaussian Process Latent Variable Models
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
Hannes Nickisch, Carl Edward Rasmussen
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
16 years 3 months ago
Online Anomaly Prediction for Robust Cluster Systems
In this paper, we present a stream-based mining algorithm for online anomaly prediction. Many real-world applications such as data stream analysis requires continuous cluster opera...
Xiaohui Gu, Haixun Wang
LCN
2007
IEEE
15 years 7 months ago
Efficient MD Coding Core Selection to Reduce the Bandwidth Consumption
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
Sunoh Choi, Sang-Seon Byun, Chuck Yoo
204
Voted
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
16 years 1 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum