Sciweavers

679 search results - page 87 / 136
» Algorithmic modifications to SPIHT
Sort
View
WD
2010
15 years 3 months ago
Self-organized aggregation in irregular wireless networks
Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor kno...
Joanna Geibig, Dirk Bradler
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 6 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
KDD
2001
ACM
145views Data Mining» more  KDD 2001»
16 years 6 months ago
Proximal support vector machine classifiers
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
Glenn Fung, Olvi L. Mangasarian
ASPLOS
1992
ACM
15 years 10 months ago
Parity Declustering for Continuous Operation in Redundant Disk Arrays
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
Mark Holland, Garth A. Gibson
ASPDAC
2001
ACM
102views Hardware» more  ASPDAC 2001»
15 years 9 months ago
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovs...