Sciweavers

4095 search results - page 4 / 819
» How to test a tree
Sort
View
EUROCRYPT
2010
Springer
14 years 14 days ago
Bonsai Trees, or How to Delegate a Lattice Basis
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
David Cash, Dennis Hofheinz, Eike Kiltz, Chris Pei...
CORR
1998
Springer
142views Education» more  CORR 1998»
13 years 7 months ago
How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism
This paper presents a multidimensional Dependency Grammar (DG), which decouples the dependency tree from word order, such that surface ordering is not determined by traversing the...
Norbert Bröker
FUN
2007
Springer
91views Algorithms» more  FUN 2007»
14 years 1 months ago
High Spies (or How to Win a Programming Contest)
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
André H. Deutz, Rudy van Vliet, Hendrik Jan...
ISSTA
2006
ACM
14 years 1 months ago
Tool support for randomized unit testing
There are several problem areas that must be addressed when applying randomization to unit testing. As yet no general, fully automated solution that works for all units has been p...
James H. Andrews, Susmita Haldar, Yong Lei, Felix ...
ICIAR
2005
Springer
14 years 1 months ago
Compressing 2-D Shapes Using Concavity Trees
Concavity trees have been known for quite some time as structural descriptors of 2-D shape; however, they haven’t been explored further until recently. This paper shows how 2-D s...
Ossama El Badawy, Mohamed S. Kamel