Sciweavers

2373 search results - page 444 / 475
» On the Theory of Structural Subtyping
Sort
View
PODC
2006
ACM
15 years 3 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
15 years 3 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
CEC
2005
IEEE
15 years 3 months ago
Sensorimotor experience and its metrics: informational geometry and the temporal horizon
Abstract- We introduce metrics on sensorimotor experience at various temporal scales based on informationtheory. Sensorimotor variables through which the experience of an agent fl...
Chrystopher L. Nehaniv
99
Voted
CVPR
2005
IEEE
15 years 3 months ago
A Measure of Deformability of Shapes, with Applications to Human Motion Analysis
In this paper we develop a theory for characterizing how deformable a shape is. We define a term called “deformability index” for shapes. The deformability index is computed ...
Amit K. Roy Chowdhury