6740 search results - page 1160 / 1348 » An s -Hamiltonian Line Graph Problem |
131
click to vote
PAMI
2006
15 years 4 months ago
2006
The goal of this paper is to provide a "self-adaptive" system for real-time range acquisition. Reconstructions are based on a single frame structured light illumination. ...
113
click to vote
SIAMJO
2008
15 years 4 months ago
2008
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
139
Voted
SMA
2008
ACM
15 years 4 months ago
2008
ACM
This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any p...
127
click to vote
TCS
2008
15 years 4 months ago
2008
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
131
click to vote
JACM
2007
15 years 4 months ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...