3708 search results - page 303 / 742 » Approximating Betweenness Centrality |
169
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
192
click to vote
BROADNETS
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Limited resources and time-varying nature of wireless ad hoc networks demand optimized use of resources across layers. Cross-layer optimization (CLO) for wireless netwo...
177
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
188
click to vote
PLDI
2010
ACM
15 years 11 months ago
2010
ACM
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
170
Voted
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...