2912 search results - page 196 / 583 » Logistic Model Trees |
121
click to vote
SMA
2003
ACM
15 years 9 months ago
2003
ACM
This paper presents a new method to compute constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. The algorith...
135
click to vote
COLING
1996
15 years 5 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
WWW
2001
ACM
16 years 4 months ago
2001
ACM
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
106
click to vote
ISLPED
2006
ACM
15 years 10 months ago
2006
ACM
This paper addresses the problem of low-power fanout optimization. We show that due to neglecting short-circuit current, previous analytical techniques proposed to optimize the ar...
124
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
The most controversial part of genetic programming is its highly disruptive and potentially innovative subtree crossover operator. The clearest problem with the crossover operator...