16430 search results - page 371 / 3286 » On Computable Tree Functions |
153
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
184
click to vote
3DIM
2007
IEEE
16 years 18 days ago
2007
IEEE
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
153
click to vote
SIGECOM
2006
ACM
16 years 5 days ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
321
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Alignment of RNA secondary structures is important in studying functional RNA motifs. In recent years, much progress has been made in RNA motif finding and structure a...
172
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...