5372 search results - page 142 / 1075 » complexity 2007 |
CCCG
2006
13 years 9 months ago
2006
We present a new normal form for bounded-curvature paths that admits a combinatorial discription of such paths and a bound on the algebraic complexity of the underlying geometry.
MASCOTS
2001
13 years 9 months ago
2001
We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity
ACL
2007
13 years 9 months ago
2007
We describe an algorithm for a novel task: disambiguating the pronoun you in conversation. You can be generic or referential; finding referential you is important for tasks such ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
This paper presents a review of methods for collecting and analysing data on complex activities. Starting with methods developed for design, we examine the possibility to transpos...
CCCG
2007
13 years 9 months ago
2007
We analyze the computational complexity of various rolling cube puzzles.