502 search results - page 42 / 101 » Verifying Balanced Trees |
104
Voted
DAS
2006
Springer
15 years 4 months ago
2006
Springer
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...
119
click to vote
ICCAD
1995
IEEE
15 years 4 months ago
1995
IEEE
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...
96
Voted
ACL
2010
14 years 10 months ago
2010
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...
95
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
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...
139
Voted
IS
2011
14 years 7 months ago
2011
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 ...