599 search results - page 34 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
200
click to vote
JPDC
2007
15 years 3 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
120
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— Broadcast protocols play a vital role in multihop wireless networks. Due to the broadcast nature of radio signals, a node’s interference range can be larger than its transmis...
150
click to vote
TIT
2010
14 years 10 months ago
2010
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to app...
110
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...