Sciweavers

10997 search results - page 317 / 2200
» On the Structure of Complete Sets
Sort
View
ICTAC
2009
Springer
15 years 4 months ago
Integration Testing from Structured First-Order Specifications via Deduction Modulo
Testing from first-order specifications has mainly been studied for flat specifications, that are specifications of a single software module. However, the specifications of large s...
Delphine Longuet, Marc Aiguier
IPPS
1998
IEEE
15 years 11 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
HVEI
2010
15 years 8 months ago
Perceptual quality assessment of color images using adaptive signal representation
Perceptual image distortion measures can play a fundamental role in evaluating and optimizing imaging systems and image processing algorithms. Many existing measures are formulate...
Umesh Rajashekar, Zhou Wang, Eero P. Simoncelli
PODS
2006
ACM
196views Database» more  PODS 2006»
16 years 7 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 11 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie