Sciweavers

2168 search results - page 53 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
132
Voted
AMC
2007
108views more  AMC 2007»
15 years 2 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
108
Voted
TCOM
2010
65views more  TCOM 2010»
14 years 9 months ago
Max-matching diversity in OFDMA systems
Abstract--This paper considers the problem of optimal subcarrier allocation in OFDMA systems to achieve the minimum outage probability while guaranteeing fairness. The optimal subc...
Bo Bai, Wei Chen, Zhigang Cao, Khaled Ben Letaief
132
Voted
PODC
2006
ACM
15 years 8 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
137
Voted
ECAI
1992
Springer
15 years 6 months ago
Phenomenology, Representations and Complexity
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
Achim G. Hoffmann
125
Voted
3DPH
2009
145views Healthcare» more  3DPH 2009»
15 years 14 days ago
The Persistent Morse Complex Segmentation of a 3-Manifold
We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in ...
Herbert Edelsbrunner, John Harer