Sciweavers

455 search results - page 80 / 91
» Structure Theorems for Systems of Segments
Sort
View
ICALP
1997
Springer
13 years 11 months ago
Recursive Computational Depth
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
James I. Lathrop, Jack H. Lutz
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 7 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 2 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
ECAL
2007
Springer
14 years 1 months ago
Multi-level Selection in the Emergence of Language Systematicity
Language can be viewed as a complex adaptive system which is continuously shaped and reshaped by the actions of its users as they try to solve communicative problems. To maintain c...
Luc Steels, Remi van Trijp, Pieter Wellens
CASES
2001
ACM
13 years 11 months ago
Transparent data-memory organizations for digital signal processors
Today's digital signal processors (DSPs), unlike general-purpose processors, use a non-uniform addressing model in which the primary components of the memory system--the DRAM...
Sadagopan Srinivasan, Vinodh Cuppu, Bruce L. Jacob