3267 search results - page 504 / 654 » Computational Models of Language Acquisition |
129
click to vote
CVPR
1999
IEEE
16 years 6 months ago
1999
IEEE
The main question we address is: what is the minimal information required to generate closed, non-intersecting planar boundaries? For this paper we restrict ‘shape’ to this mea...
149
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
136
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
158
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
130
click to vote
ICCAD
2003
IEEE
16 years 1 months ago
2003
IEEE
Modeling and simulating pipelined processors in procedural languages such as C/C++ requires lots of cost in handling concurrent events, which hinders fast simulation. A number of ...