1101 search results - page 175 / 221 » An Algorithm for the Graph Crossing Number Problem |
114
click to vote
DCC
2011
IEEE
14 years 9 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
117
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
132
click to vote
DIALM
2003
ACM
15 years 7 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
136
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
As the World Wide Web in China grows rapidly, mining knowledge in Chinese Web pages becomes more and more important. Mining Web information usually relies on the machine learning ...
102
click to vote
DIALM
2008
ACM
15 years 3 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...