Sciweavers

5785 search results - page 386 / 1157
» Approximability of Probability Distributions
Sort
View
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
13 years 9 months ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
16 years 8 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...
ICDE
1999
IEEE
150views Database» more  ICDE 1999»
16 years 8 months ago
Managing Distributed Memory to Meet Multiclass Workload Response Time Goals
In this paper we present an online method for managing a goaloriented buffer partitioning in the distributed memory of a network of workstations. Our algorithm implements a feedba...
Arnd Christian König, Markus Sinnwell
EDBT
2006
ACM
136views Database» more  EDBT 2006»
16 years 6 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen
ALT
2002
Springer
16 years 3 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...