Sciweavers

205 search results - page 18 / 41
» On Approximation Algorithms for Hierarchical MAX-SAT
Sort
View
EDBT
2004
ACM
187views Database» more  EDBT 2004»
15 years 12 months ago
Hierarchical In-Network Data Aggregation with Quality Guarantees
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
ICML
2004
IEEE
16 years 18 days ago
A multiplicative up-propagation algorithm
We present a generalization of the nonnegative matrix factorization (NMF), where a multilayer generative network with nonnegative weights is used to approximate the observed nonne...
Jong-Hoon Ahn, Seungjin Choi, Jong-Hoon Oh
CIKM
2004
Springer
15 years 5 months ago
Framework and algorithms for trend analysis in massive temporal data sets
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
Sreenivas Gollapudi, D. Sivakumar
FSTTCS
2009
Springer
15 years 6 months ago
Algorithms for Message Ferrying on Mobile ad hoc Networks
ABSTRACT. Message Ferrying is a mobility assisted technique for working around the disconnectedness and sparsity of Mobile ad hoc networks. One of the important questions which ari...
Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das...
COMPGEOM
2010
ACM
15 years 4 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park