Sciweavers

9659 search results - page 1597 / 1932
» Points on Computable Curves
Sort
View
EWSN
2009
Springer
16 years 7 months ago
MVSink: Incrementally Building In-Network Aggregation Trees
Abstract. In-network data aggregation is widely recognized as an acceptable means to reduce the amount of transmitted data without adversely affecting the quality of the results. T...
Leonardo L. Fernandes, Amy L. Murphy
KDD
2006
ACM
163views Data Mining» more  KDD 2006»
16 years 7 months ago
New EM derived from Kullback-Leibler divergence
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...
Longin Jan Latecki, Marc Sobel, Rolf Lakämper
KDD
2002
ACM
118views Data Mining» more  KDD 2002»
16 years 7 months ago
SECRET: a scalable linear regression tree algorithm
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...
Alin Dobra, Johannes Gehrke
POPL
2007
ACM
16 years 7 months ago
Interprocedural analysis of asynchronous programs
An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and "dispatched" in a non-deterministic ord...
Ranjit Jhala, Rupak Majumdar
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
16 years 7 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
« Prev « First page 1597 / 1932 Last » Next »