Sciweavers

1945 search results - page 19 / 389
» Speeding up Serpent
Sort
View
CP
2005
Springer
14 years 28 days ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
PAKDD
2005
ACM
120views Data Mining» more  PAKDD 2005»
14 years 27 days ago
Speeding-Up Hierarchical Agglomerative Clustering in Presence of Expensive Metrics
In several contexts and domains, hierarchical agglomerative clustering (HAC) offers best-quality results, but at the price of a high complexity which reduces the size of datasets ...
Mirco Nanni
PKDD
2005
Springer
142views Data Mining» more  PKDD 2005»
14 years 27 days ago
Speeding Up Logistic Model Tree Induction
Logistic Model Trees have been shown to be very accurate and compact classifiers [8]. Their greatest disadvantage is the computational complexity of inducing the logistic regressi...
Marc Sumner, Eibe Frank, Mark A. Hall
WEA
2005
Springer
294views Algorithms» more  WEA 2005»
14 years 26 days ago
Partitioning Graphs to Speed Up Dijkstra's Algorithm
Rolf H. Möhring, Heiko Schilling, Birk Sch&uu...