Sciweavers

1390 search results - page 83 / 278
» Streaming Algorithms Measured in Terms of the Computed Quant...
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 9 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
14 years 24 days ago
On the Effect of Trajectory Compression in Spatiotemporal Querying
Existing work repeatedly addresses that the ubiquitous positioning devices will start to generate an unprecedented stream of time-stamped positions leading to storage and computati...
Elias Frentzos, Yannis Theodoridis
MIDDLEWARE
2007
Springer
14 years 2 months ago
A piggybacking approach to reduce overhead in sensor network gossiping
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
Ercan Ucan, Nathanael Thompson, Indranil Gupta
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
14 years 2 months ago
Kernel based automatic clustering using modified particle swarm optimization algorithm
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
Ajith Abraham, Swagatam Das, Amit Konar
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
14 years 3 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen