Sciweavers

2694 search results - page 340 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
VLDB
2005
ACM
129views Database» more  VLDB 2005»
16 years 1 days ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 11 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
IPPS
2007
IEEE
16 years 26 days ago
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
Hailiang Mei, Pravin Pawar, Ing Widya
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
16 years 8 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
SRDS
1999
IEEE
15 years 10 months ago
On Diffusing Updates in a Byzantine Environment
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...
Dahlia Malkhi, Yishay Mansour, Michael K. Reiter