73 search results - page 13 / 15 » Tight Bounds on the Descriptional Complexity of Regular Expr... |
CICLING
2003
Springer
14 years 21 days ago
2003
Springer
The theory of realizational morphology presented by Stump in his influential book Inflectional Morphology (2001) describes the derivation of inflected surface forms from underly...
CASES
2009
ACM
14 years 2 months ago
2009
ACM
Embedded processors have become increasingly complex, resulting in variable execution behavior and reduced timing predictability. On such processors, safe timing specifications e...
PODC
2004
ACM
14 years 27 days ago
2004
ACM
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
CG
2006
Springer
13 years 7 months ago
2006
Springer
In most previous NPR line rendering systems, geometric properties have been directly used to extract and stylize certain edges. However, this approach is bound to a tight stylizat...
TWC
2010
13 years 2 months ago
2010
In this paper, the training sequence design for multiple-input multiple-output (MIMO) orthogonal frequencydivision multiplexing (OFDM) systems under the minimum mean square error (...