Sciweavers

2553 search results - page 35 / 511
» Modeling Trees with Hypertextures
Sort
View
INTEGRATION
2002
57views more  INTEGRATION 2002»
14 years 9 months ago
To Booth or not to Booth
Booth Recoding is a commonly used technique to recode one of the operands in binary multiplication. In this way the implementation of a multipliers' adder tree can be improve...
Wolfgang J. Paul, Peter-Michael Seidel
ACL
2010
14 years 7 months ago
Bitext Dependency Parsing with Bilingual Subtree Constraints
This paper proposes a dependency parsing method that uses bilingual constraints to improve the accuracy of parsing bilingual texts (bitexts). In our method, a targetside tree frag...
Wenliang Chen, Jun'ichi Kazama, Kentaro Torisawa
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 5 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
EMNLP
2010
14 years 7 months ago
A Tree Kernel-Based Unified Framework for Chinese Zero Anaphora Resolution
This paper proposes a unified framework for zero anaphora resolution, which can be divided into three sub-tasks: zero anaphor detection, anaphoricity determination and antecedent ...
Fang Kong, Guodong Zhou
RE
2002
Springer
14 years 9 months ago
A Software Fault Tree Approach to Requirements Analysis of an Intrusion Detection System
Requirements analysis for an Intrusion Detection System (IDS) involves deriving requirements for the IDS from analysis of the intrusion domain. When the IDS is, as here, a collecti...
Guy G. Helmer, Johnny S. Wong, Mark Slagell, Vasan...