4894 search results - page 659 / 979 » The Guarding Problem - Complexity and Approximation |
156
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
235
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
141
click to vote
ADHOCNETS
2009
Springer
15 years 10 months ago
2009
Springer
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
137
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
160
click to vote
WCNC
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...