5316 search results - page 310 / 1064 » Which Search Problems Are Random |
168
click to vote
EPIA
1997
Springer
15 years 10 months ago
1997
Springer
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
185
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
We consider the problem of determining functions of an image of an object that are insensitive to illumination changes. We rst show that for an object with Lambertian r e e ctanc ...
190
click to vote
ACNS
2005
Springer
15 years 11 months ago
2005
Springer
We consider the following problem: a user U wants to store his files in an encrypted form on a remote file server S. Later the user U wants to efficiently retrieve some of the en...
207
click to vote
CVPR
2007
IEEE
15 years 10 months ago
2007
IEEE
Interactively learning from a small sample of unlabeled examples is an enormously challenging task, one that often arises in vision applications. Relevance feedback and more recen...
167
click to vote
NN
2002
Springer
15 years 5 months ago
2002
Springer
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...