1578 search results - page 281 / 316 » Direct Routing: Algorithms and Complexity |
TOG
2012
12 years 10 days ago
2012
We present a dynamic tree modeling and representation technique that allows complex tree models to interact with their environment. Our method uses changes in the light distributi...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
SODA
1992
ACM
13 years 11 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
RTAS
2006
IEEE
14 years 3 months ago
2006
IEEE
The rapid need for high bandwidth and low latency communication in distributed real-time systems is driving system architects towards high-speed switches developed for high volume...
DAGM
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...