Sciweavers

630 search results - page 32 / 126
» Optimized union of non-disjoint distributed data sets
Sort
View
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 1 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
DAGSTUHL
2007
14 years 11 months ago
Learning Probabilistic Relational Dynamics for Multiple Tasks
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...
Ashwin Deshpande, Brian Milch, Luke S. Zettlemoyer...
VLDB
1999
ACM
224views Database» more  VLDB 1999»
15 years 2 months ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim
GLOBECOM
2006
IEEE
15 years 3 months ago
Bayesian Data Fusion for Asynchronous DS-CDMA Sensor Networks in Rayleigh Fading
Abstract— In this paper, we propose asynchronous non-orthogonal communication between distributed sensors and a data fusion center via asynchronous direct-sequence code-division ...
Justin S. Dyer, Balasubramaniam Natarajan, Sudharm...
GECCO
2003
Springer
15 years 3 months ago
Pruning Neural Networks with Distribution Estimation Algorithms
Abstract. This paper describes the application of four evolutionary algorithms to the pruning of neural networks used in classification problems. Besides of a simple genetic algor...
Erick Cantú-Paz