Sciweavers

1055 search results - page 39 / 211
» Enumerations in computable structure theory
Sort
View
NIPS
2001
13 years 11 months ago
A theory of neural integration in the head-direction system
Integration in the head-direction system is a computation by which horizontal angular head velocity signals from the vestibular nuclei are integrated to yield a neural representat...
Richard H. R. Hahnloser, Xiaohui Xie, H. Sebastian...
SI3D
2005
ACM
14 years 3 months ago
Broad-phase collision detection using semi-adjusting BSP-trees
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
Rodrigo G. Luque, João Luiz Dihl Comba, Car...
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
13 years 10 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
TOCL
2012
235views Formal Methods» more  TOCL 2012»
12 years 15 days ago
Topological and Simplicial Models of Identity Types
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
Benno van den Berg, Richard Garner
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 5 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...