Sciweavers

2069 search results - page 238 / 414
» Linear time algorithms for Clobber
Sort
View
EUROPAR
2011
Springer
14 years 6 months ago
A Bit-Compatible Parallelization for ILU(k) Preconditioning
Abstract. ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present T...
Xin Dong 0004, Gene Cooperman
RECOMB
2006
Springer
16 years 6 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 6 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
IDEAS
2002
IEEE
113views Database» more  IDEAS 2002»
15 years 11 months ago
Scalable QoS-Aware Disk-Scheduling
A new quality of service (QoS) aware disk scheduling algorithm is presented. It is applicable in environments where data requests arrive with different QoS requirements such as re...
Walid G. Aref, Khaled El-Bassyouni, Ibrahim Kamel,...
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
15 years 10 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann