Sciweavers

502 search results - page 42 / 101
» Verifying Balanced Trees
Sort
View
DAS
2006
Springer
14 years 1 months ago
Structural Analysis of Mathematical Formulae with Verification Based on Formula Description Grammar
In this paper, a reliable and efficient structural analysis method for mathematical formulae is proposed for practical mathematical OCR. The proposed method consists of three steps...
Seiichi Toyota, Seiichi Uchida, Masakazu Suzuki
ICCAD
1995
IEEE
129views Hardware» more  ICCAD 1995»
14 years 1 months ago
Activity-driven clock design for low power circuits
In this paper we investigate activity-driven clock trees to reduce the dynamic power consumption of synchronous digital CMOS circuits. Sections of an activity-driven clock tree ca...
Gustavo E. Téllez, Amir H. Farrahi, Majid S...
ACL
2010
13 years 8 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
MFCS
2009
Springer
14 years 4 months ago
Branching Programs for Tree Evaluation
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
IS
2011
13 years 4 months ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...