Sciweavers

4095 search results - page 80 / 819
» How to test a tree
Sort
View
ICDCS
2002
IEEE
14 years 2 months ago
Key Trees and the Security of Interval Multicast
A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys i...
Mohamed G. Gouda, Chin-Tser Huang, E. N. Elnozahy
ACL
1998
13 years 10 months ago
Using Decision Trees to Construct a Practical Parser
This paper describes novel and practical Japanese parsers that uses decision trees. First, we construct a single decision tree to estimate modification probabilities; how one phra...
Masahiko Haruno, Satoshi Shirai, Yoshifumi Ooyama
ACL
2006
13 years 10 months ago
Speeding Up Full Syntactic Parsing by Leveraging Partial Parsing Decisions
Parsing is a computationally intensive task due to the combinatorial explosion seen in chart parsing algorithms that explore possible parse trees. In this paper, we propose a meth...
Elliot Glaysher, Dan I. Moldovan
PAMI
2007
166views more  PAMI 2007»
13 years 8 months ago
A Bayesian, Exemplar-Based Approach to Hierarchical Shape Matching
—This paper presents a novel probabilistic approach to hierarchical, exemplar-based shape matching. No feature correspondence is needed among exemplars, just a suitable pairwise ...
Dariu Gavrila
VL
2005
IEEE
142views Visual Languages» more  VL 2005»
14 years 2 months ago
JOpera: An Agile Environment for Web Service Composition with Visual Unit Testing and Refactoring
Agile methodologies employ light-weight development practices emphasizing a test-driven approach to the development of software systems. Modern agile development environments supp...
Cesare Pautasso