6045 search results - page 1130 / 1209 » Computable Linearizations of Well-partial-orderings |
ICALP
1990
Springer
13 years 12 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
CASES
2007
ACM
13 years 12 months ago
2007
ACM
The key to increasing performance without a commensurate increase in power consumption in modern processors lies in increasing both parallelism and core specialization. Core speci...
COLT
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
CAV
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...