5606 search results - page 368 / 1122 » Randomization Techniques for Graphs. |
181
click to vote
IJCAI
2007
15 years 8 months ago
2007
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
185
click to vote
CSL
2004
Springer
15 years 6 months ago
2004
Springer
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...
218
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
182
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
159
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...