492 search results - page 42 / 99 » The number of possibilities for random dating |
86
Voted
SODA
2008
ACM
14 years 11 months ago
2008
ACM
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,&...
103
click to vote
TIT
2010
14 years 4 months ago
2010
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...
ISPW
2008
IEEE
15 years 4 months ago
2008
IEEE
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...
110
click to vote
CVPR
2004
IEEE
16 years 6 days ago
2004
IEEE
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...
90
Voted
ESORICS
2004
Springer
15 years 3 months ago
2004
Springer
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). ...