Sciweavers

663 search results - page 57 / 133
» A Parallel Algorithm for Enumerating Combinations
Sort
View
PODS
2010
ACM
150views Database» more  PODS 2010»
15 years 7 months ago
Understanding queries in a search database system
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 1 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
VECPAR
2004
Springer
15 years 7 months ago
Domain Decomposition Methods for PDE Constrained Optimization Problems
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
Ernesto E. Prudencio, Richard H. Byrd, Xiao-Chuan ...
ICPP
2000
IEEE
15 years 6 months ago
Partitioning Loops with Variable Dependence Distances
A new technique to parallelize loops with variable distance vectors is presented. The method extends previous methods in two ways. First, the present method makes it possible for ...
Yijun Yu, Erik H. D'Hollander
ICPP
2002
IEEE
15 years 6 months ago
An Efficient Fault-Tolerant Scheduling Algorithm for Real-Time Tasks with Precedence Constraints in Heterogeneous Systems
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provi...
Xiao Qin, Hong Jiang, David R. Swanson