Sciweavers

115 search results - page 4 / 23
» Versioning Tree Structures by Path-Merging
Sort
View
EUROPAR
2003
Springer
13 years 11 months ago
Parallelization with Tree Skeletons
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
JSAT
2008
57views more  JSAT 2008»
13 years 6 months ago
tts: A SAT-Solver for Small, Difficult Instances
The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a st...
Ivor Spence
COLING
1992
13 years 7 months ago
Modularity, Parallelism, And Licensing In A Principle-Based Parser For German
This paper presents a direct implementation of Government-Binding theory in a parser for German, which faithfully models the modular structure of the theory. The modular design yi...
Sebastian Millies
ACNS
2005
Springer
138views Cryptology» more  ACNS 2005»
13 years 11 months ago
Indexing Information for Data Forensics
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
Michael T. Goodrich, Mikhail J. Atallah, Roberto T...
EACL
1993
ACL Anthology
13 years 7 months ago
Formal Properties of Metrical Structure
This paper offers a provisional mathematical typology of metrical representations. First, a family of algebras corresponding to different versions of grid and bracketed grid theor...
Marc van Oostendorp