Sciweavers

9532 search results - page 1563 / 1907
» Logic, Graphs, and Algorithms
Sort
View
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 6 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
BMCBI
2006
120views more  BMCBI 2006»
15 years 6 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
TOPLAS
2008
81views more  TOPLAS 2008»
15 years 6 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
CVIU
2004
134views more  CVIU 2004»
15 years 6 months ago
The "dead reckoning" signed distance transform
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
George J. Grevera
PODS
2002
ACM
168views Database» more  PODS 2002»
16 years 6 months ago
Conjunctive Selection Conditions in Main Memory
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...
Kenneth A. Ross
« Prev « First page 1563 / 1907 Last » Next »