Sciweavers

942 search results - page 149 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 4 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
FSTTCS
2009
Springer
14 years 4 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina
NETWORKING
2007
13 years 11 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen
CVPR
2011
IEEE
13 years 6 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...
INFOCOM
2011
IEEE
13 years 1 months ago
Multiple task scheduling for low-duty-cycled wireless sensor networks
—For energy conservation, a wireless sensor network is usually designed to work in a low-duty-cycle mode, in which a sensor node keeps active for a small percentage of time durin...
Shuguang Xiong, Jianzhong Li, Mo Li, Jiliang Wang,...