Sciweavers

1418 search results - page 148 / 284
» Schema polynomials and applications
Sort
View
GRAMMARS
2000
100views more  GRAMMARS 2000»
15 years 6 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
SCL
2010
146views more  SCL 2010»
15 years 4 months ago
Decay of Hankel singular values of analytic control systems
We show that control systems with an analytic semigroup and control and observation operators that are not too unbounded have a Hankel operator that belongs to the Schatten class ...
Mark R. Opmeer
DNA
2011
Springer
213views Bioinformatics» more  DNA 2011»
14 years 6 months ago
Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes
Sticker complexes are a a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a pure...
Robert Brijder, Joris J. M. Gillis, Jan Van den Bu...
ASPDAC
2007
ACM
121views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Approximation Algorithm for Process Mapping on Network Processor Architectures
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
Christopher Ostler, Karam S. Chatha, Goran Konjevo...
AAAI
2010
15 years 7 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr