62 search results - page 10 / 13 » On the chromatic number of random geometric graphs |
164
click to vote
TCOM
2010
15 years 4 months ago
2010
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
148
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
204
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
A study of generalization error in signal detection by multiple spatially-distributed and -correlated sensors is provided when the detection rule is learned from a finite number ...
178
click to vote
DAM
2000
15 years 5 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
168
click to vote
IJCV
2012
13 years 8 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...