583 search results - page 26 / 117 » Efficient algorithms for constructing decision trees with co... |
ASPDAC
1998
ACM
15 years 1 months ago
1998
ACM
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Efficient BDD construction techniques become more important as the complexity of proto...
100
click to vote
GIS
2010
ACM
14 years 8 months ago
2010
ACM
Local search is a specialization of the web search that allows users to submit geographically constrained queries. However, one of the challenges for local search engines is to un...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
143
click to vote
ICCAD
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
101
click to vote
EGH
2010
Springer
14 years 7 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...