Sciweavers

153 search results - page 20 / 31
» Approximating node connectivity problems via set covers
Sort
View
CVPR
2011
IEEE
14 years 5 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
14 years 11 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
15 years 10 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
INFOCOM
2007
IEEE
15 years 4 months ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
COCOA
2009
Springer
15 years 1 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...