Sciweavers

1299 search results - page 13 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
IPPS
2005
IEEE
15 years 3 months ago
Code-Size Minimization in Multiprocessor Real-Time Systems
— Program code size is a critical factor in determining the manufacturing cost of many embedded systems, particularly those aimed at the extremely costconscious consumer market. ...
Sanjoy K. Baruah, Nathan Fisher
ICDCS
2008
IEEE
15 years 4 months ago
Fair K Mutual Exclusion Algorithm for Peer to Peer Systems
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
Vijay Anand Reddy, Prateek Mittal, Indranil Gupta
CVPR
2004
IEEE
15 years 11 months ago
Stereo Correspondence with Slanted Surfaces: Critical Implications of Horizontal Slant
We examine the stereo correspondence problem in the presence of slanted scene surfaces. In particular, we highlight a previously overlooked geometric fact: a horizontally slanted ...
Abhijit S. Ogale, Yiannis Aloimonos
CP
2007
Springer
15 years 1 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
DBA
2006
182views Database» more  DBA 2006»
14 years 11 months ago
Matrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
Judith Pavón, Sidney Viana, Santiago G&oacu...