Sciweavers

5981 search results - page 288 / 1197
» time 2006
Sort
View
COMBINATORICS
2006
169views more  COMBINATORICS 2006»
15 years 6 months ago
The Diameter and Laplacian Eigenvalues of Directed Graphs
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
Fan R. K. Chung
IJAR
2006
125views more  IJAR 2006»
15 years 6 months ago
Compiling relational Bayesian networks for exact inference
We describe in this paper a system for exact inference with relational Bayesian networks as defined in the publicly available Primula tool. The system is based on compiling propos...
Mark Chavira, Adnan Darwiche, Manfred Jaeger
IJCGA
2006
85views more  IJCGA 2006»
15 years 6 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
IJCGA
2006
79views more  IJCGA 2006»
15 years 6 months ago
Well-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
Gui-Fang Zhang, Xiao-Shan Gao
194
Voted
IJFCS
2006
63views more  IJFCS 2006»
15 years 6 months ago
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
Mourad Hakem, Franck Butelle