7228 search results - page 414 / 1446 » From Algorithmic to Subjective Randomness |
193
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Visitors enter a website through a variety of means, including web searches, links from other sites, and personal bookmarks. In some cases the first page loaded satisfies the visi...
201
click to vote
CVPR
2006
IEEE
16 years 25 days ago
2006
IEEE
This paper describes an algorithm for pose and illumination invariant face recognition from a single image under occlusions. The method iteratively estimates the parameters of a 3...
166
click to vote
ASPDAC
1995
ACM
15 years 10 months ago
1995
ACM
- We address the problem of transforming a behavioral specification so that synthesis of a testable implementation from the new specification requires significantly less area and ...
163
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
248
click to vote
IJCAI
2003
15 years 8 months ago
2003
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...