1101 search results - page 111 / 221 » An Algorithm for the Graph Crossing Number Problem |
138
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
149
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
123
click to vote
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
147
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
145
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...