Sciweavers

319 search results - page 28 / 64
» Some Performance Studies in Exact Linear Algebra
Sort
View
JDA
2006
85views more  JDA 2006»
14 years 11 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger
SUM
2007
Springer
15 years 6 months ago
Finding Most Probable Worlds of Probabilistic Logic Programs
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
Samir Khuller, Maria Vanina Martinez, Dana S. Nau,...
CAD
2004
Springer
14 years 11 months ago
Parametric representation of a surface pencil with a common spatial geodesic
In this paper, we study the problem of constructing a family of surfaces from a given spatial geodesic curve. We derive a parametric representation for a surface pencil whose memb...
Guo-Jin Wang, Kai Tang, Chiew-Lan Tai
PE
2011
Springer
167views Optimization» more  PE 2011»
14 years 6 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...
ISCI
2007
141views more  ISCI 2007»
14 years 11 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...