Sciweavers

13603 search results - page 418 / 2721
» On the Complexity of Computing Treelength
Sort
View
ATVA
2006
Springer
106views Hardware» more  ATVA 2006»
15 years 11 months ago
Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier E...
DSVIS
2006
Springer
15 years 11 months ago
Toward Quality-Driven Development of 3D Computer Games
The development of video games is a complex software engineering activity bringing together large multidisciplinary teams under stringent constraints. While much has been written a...
T. C. Nicholas Graham, Will Roberts
ESANN
2007
15 years 9 months ago
An overview of reservoir computing: theory, applications and implementations
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
Benjamin Schrauwen, David Verstraeten, Jan M. Van ...
IADIS
2004
15 years 9 months ago
Computation and Construction Kits: Toward the Next Generation of Tangible Building Media for Children
Construction kits represent a venerable, creative, and (occasionally) even beautiful genre of educational toys for children. Nonetheless, traditional construction kits have limita...
Michael Eisenberg, Leah Buechley, Nwanua Elumeze
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
15 years 7 months ago
Computing the Greedy Spanner in Near-Quadratic Time
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...