942 search results - page 142 / 189 » Constraints in Graph Drawing Algorithms |
138
Voted
CVPR
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
125
Voted
SODA
2007
ACM
15 years 4 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
167
click to vote
TON
2008
15 years 2 months ago
2008
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...
154
Voted
FSTTCS
1993
Springer
15 years 6 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
123
Voted
FOCS
2000
IEEE
15 years 6 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...