Sciweavers

376 search results - page 34 / 76
» Betweenness Centrality : Algorithms and Lower Bounds
Sort
View
APPROX
2011
Springer
284views Algorithms» more  APPROX 2011»
12 years 7 months ago
On Approximating the Number of Relevant Variables in a Function
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
Dana Ron, Gilad Tsur
STOC
1999
ACM
125views Algorithms» more  STOC 1999»
14 years 22 hour ago
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
David R. Karger, Philip N. Klein, Clifford Stein, ...
INFOCOM
2010
IEEE
13 years 6 months ago
Collaborative Measurements of Upload Speeds in P2P Systems
—In this paper, we study the theory of collaborative upload bandwidth measurement in peer-to-peer environments. A host can use a bandwidth estimation probe to determine the bandw...
John R. Douceur, James W. Mickens, Thomas Moscibro...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
ICRA
2005
IEEE
117views Robotics» more  ICRA 2005»
14 years 1 months ago
CBUG: A Quadratically Competitive Mobile Robot Navigation Algorithm
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...
Yoav Gabriely, Elon Rimon