4865 search results - page 327 / 973 » The Complexity of Graph Connectivity |
151
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channel...
155
click to vote
DAM
2006
15 years 6 months ago
2006
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
177
click to vote
PAMI
2006
15 years 6 months ago
2006
High dimensional structured data such as text and images is often poorly understood and misrepresented in statistical modeling. The standard histogram representation suffers from ...
188
click to vote
AMAI
2005
Springer
15 years 6 months ago
2005
Springer
Binary-clause reasoning has been shown to reduce the size of the search space on many satisfiability problems, but has often been so expensive that run-time was higher than that o...
153
click to vote
IPL
2011
15 years 1 months ago
2011
In this paper, we study the stationary node distribution of a variation of the Random Waypoint mobility model, in which nodes move in a smooth way following one randomly chosen Ma...