Sciweavers

2084 search results - page 219 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
ACID
2006
236views Algorithms» more  ACID 2006»
14 years 11 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....
SDM
2007
SIAM
198views Data Mining» more  SDM 2007»
14 years 11 months ago
Learning from Time-Changing Data with Adaptive Windowing
We present a new approach for dealing with distribution change and concept drift when learning from data sequences that may vary with time. We use sliding windows whose size, inst...
Albert Bifet, Ricard Gavaldà
COMSWARE
2007
IEEE
15 years 4 months ago
Distributed Fault-Tolerant Topology Control in Static and Mobile Wireless Sensor Networks
— In wireless sensor networks, minimizing power consumption and at the same time maintaining desired properties in the network topology is of prime importance. In this work, we p...
Indranil Saha, Lokesh Kumar Sambasivan, Ranjeet Ku...
ECCC
2011
207views ECommerce» more  ECCC 2011»
14 years 5 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
DAC
2006
ACM
15 years 11 months ago
Statistical timing analysis with correlated non-gaussian parameters using independent component analysis
We propose a scalable and efficient parameterized block-based statistical static timing analysis algorithm incorporating both Gaussian and non-Gaussian parameter distributions, ca...
Jaskirat Singh, Sachin S. Sapatnekar