Sciweavers

4451 search results - page 488 / 891
» On Random Ordering Constraints
Sort
View
179
Voted
ICPR
2000
IEEE
15 years 10 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 10 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
CCS
2008
ACM
15 years 8 months ago
A class of probabilistic models for role engineering
Role Engineering is a security-critical task for systems using role-based access control (RBAC). Different role-mining approaches have been proposed that attempt to automatically ...
Mario Frank, David A. Basin, Joachim M. Buhmann
ISQED
2010
IEEE
123views Hardware» more  ISQED 2010»
15 years 8 months ago
Yield-constrained digital circuit sizing via sequential geometric programming
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...
Yu Ben, Laurent El Ghaoui, Kameshwar Poolla, Costa...
SIROCCO
2008
15 years 8 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau