Sciweavers

492 search results - page 42 / 99
» The number of possibilities for random dating
Sort
View
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
13 years 10 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
TIT
2010
130views Education» more  TIT 2010»
13 years 3 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
ISPW
2008
IEEE
14 years 3 months ago
Accurate Estimates without Calibration?
Most process models calibrate their internal settings using historical data. Collecting this data is expensive, tedious, and often an incomplete process. Is it possible to make acc...
Tim Menzies, Oussama El-Rawas, Barry W. Boehm, Ray...
CVPR
2004
IEEE
14 years 10 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
ESORICS
2004
Springer
14 years 2 months ago
Portable and Flexible Document Access Control Mechanisms
We present and analyze portable access control mechanisms for large data repositories, in that the customized access policies are stored on a portable device (e.g., a smart card). ...
Mikhail J. Atallah, Marina Bykova