1949 search results - page 87 / 390 » Random graphs on surfaces |
103
click to vote
APAL
2008
15 years 4 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
132
click to vote
CPC
2006
15 years 4 months ago
2006
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
117
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
124
click to vote
AMS
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a new approach for incremental 3D SLAM from segmented range images with unknown feature association. For feature and motion tracking, an any-time interpretation...
162
click to vote
NIPS
2004
15 years 5 months ago
2004
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...