Sciweavers

220 search results - page 24 / 44
» Distributed Minimum Cut Approximation
Sort
View
COMPGEOM
2009
ACM
14 years 4 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
ALMOB
2006
109views more  ALMOB 2006»
13 years 10 months ago
A novel functional module detection algorithm for protein-protein interaction networks
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...
MONET
2008
135views more  MONET 2008»
13 years 9 months ago
Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
Lili Cao, Haitao Zheng
PODS
2012
ACM
276views Database» more  PODS 2012»
12 years 9 days ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
ICASSP
2008
IEEE
14 years 4 months ago
Distributed compressed sensing: Sparsity models and reconstruction algorithms using annihilating filter
Consider a scenario where a distributed signal is sparse and is acquired by various sensors that see different versions. Thus, we have a set of sparse signals with both some commo...
Ali Hormati, Martin Vetterli