Sciweavers

801 search results - page 18 / 161
» Minimal Locked Trees
Sort
View
CADE
1998
Springer
15 years 1 months ago
Rank/Activity: A Canonical Form for Binary Resolution
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
Joseph Douglas Horton, Bruce Spencer
ACL
2007
14 years 11 months ago
Optimizing Grammars for Minimum Dependency Length
We examine the problem of choosing word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the optimal layout of ...
Daniel Gildea, David Temperley
IWOCA
2009
Springer
119views Algorithms» more  IWOCA 2009»
15 years 4 months ago
Minimax Trees in Linear Time with Applications
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus i...
Pawel Gawrychowski, Travis Gagie
80
Voted
CAV
2009
Springer
134views Hardware» more  CAV 2009»
15 years 10 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...
88
Voted
ASPLOS
2012
ACM
13 years 5 months ago
Scalable address spaces using RCU balanced trees
Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared addre...
Austin T. Clements, M. Frans Kaashoek, Nickolai Ze...