Sciweavers

837 search results - page 136 / 168
» Distributed algorithms for reaching consensus on general fun...
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
MOBIHOC
2002
ACM
15 years 9 months ago
Minimum energy paths for reliable communication in multi-hop wireless networks
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...
Suman Banerjee, Archan Misra
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
15 years 1 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
ECCV
2006
Springer
15 years 11 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
DAC
2007
ACM
15 years 10 months ago
Voltage-Frequency Island Partitioning for GALS-based Networks-on-Chip
Due to high levels of integration and complexity, the design of multi-core SoCs has become increasingly challenging. In particular, energy consumption and distributing a single gl...
Ümit Y. Ogras, Diana Marculescu, Puru Choudha...