Sciweavers

738 search results - page 88 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
15 years 3 months ago
Symbolic Test Selection Based on Approximate Analysis
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu,...
TROB
2002
138views more  TROB 2002»
14 years 9 months ago
Interference-free polyhedral configurations for stacking
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
Venkateswara R. Ayyadevara, David A. Bourne, Kenji...
ECCV
2002
Springer
15 years 11 months ago
Bayesian Estimation of Layers from Multiple Images
When estimating foreground and background layers (or equivalently an alpha matte), it is often the case that pixel measurements contain mixed colours which are a combination of for...
Yonatan Wexler, Andrew W. Fitzgibbon, Andrew Zisse...
IPPS
1998
IEEE
15 years 2 months ago
An Efficient RMS Admission Control and Its Application to Multiprocessor Scheduling
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks accepted in the system will meet their timing requiremen...
Sylvain Lauzac, Rami G. Melhem, Daniel Mossé...