Sciweavers

1728 search results - page 142 / 346
» The Accelerated Euclidean Algorithm
Sort
View
IEEECIT
2009
IEEE
15 years 9 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi
ICML
2006
IEEE
16 years 4 months ago
Sequential update of ADtrees
Ingcreasingly, data-mining algorithms must deal with databases that continuously grow over time. These algorithms must avoid repeatedly scanning their databases. When database att...
Josep Roure, Andrew W. Moore
129
Voted
CAV
2007
Springer
120views Hardware» more  CAV 2007»
15 years 9 months ago
Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
Chao Wang, Zijiang Yang, Aarti Gupta, Franjo Ivanc...
ICIP
2003
IEEE
15 years 8 months ago
Fast hierarchical backprojection for helical cone-beam tomography
Existing algorithms for exact helical cone beam (HCB) tomographic reconstruction are computationally infeasible for clinical applications. Their computational cost is dominated by...
Yoram Bresler, Jeffrey Brokish
BNCOD
2007
160views Database» more  BNCOD 2007»
15 years 4 months ago
Parameterized XPath Views
: We present a new approach for accelerating the execution of XPath expressions using parameterized materialized XPath views (PXV). While the approach is generic we show how it can...
Timo Böhme, Erhard Rahm