Sciweavers

807 search results - page 20 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
ISCI
2006
96views more  ISCI 2006»
14 years 11 months ago
A comparison of classification accuracy of four genetic programming-evolved intelligent structures
We investigate the effectiveness of GP-generated intelligent structures in classification tasks. Specifically, we present and use four context-free grammars to describe (1) decisi...
Athanasios Tsakonas
IPPS
1998
IEEE
15 years 4 months ago
ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets
In this paper, we present ScalParC (Scalable Parallel Classifier), a new parallel formulation of a decision tree based classification process. Like other state-of-the-art decision...
Mahesh V. Joshi, George Karypis, Vipin Kumar
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 3 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 12 days ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
C3S2E
2010
ACM
15 years 24 days ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire