Sciweavers

2657 search results - page 86 / 532
» On the complexity of hierarchical problem solving
Sort
View
NIPS
2000
15 years 2 months ago
Foundations for a Circuit Complexity Theory of Sensory Processing
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
Robert A. Legenstein, Wolfgang Maass
ICALP
2010
Springer
15 years 6 months ago
Pumping and Counting on the Regular Post Embedding Problem
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
Pierre Chambart, Philippe Schnoebelen
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
14 years 12 months ago
Leader Election Problem versus Pattern Formation Problem
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
Yoann Dieudonné, Franck Petit, Vincent Vill...
CGF
2000
78views more  CGF 2000»
15 years 1 months ago
Using an Intermediate Skeleton and Inverse Kinematics for Motion Retargeting
In this paper, we present a new method for solving the Motion Retargeting Problem, by using an intermediate skeleton. This allows us to convert movements between hierarchically an...
Jean-Sébastien Monzani, Paolo Baerlocher, R...
ICPR
2008
IEEE
15 years 8 months ago
Birkhoff polytopes, heat kernels and graph complexity
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
Francisco Escolano, Edwin R. Hancock, Miguel Angel...