934 search results - page 26 / 187 » A theoretical analysis of the HIFF problem |
119
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
125
click to vote
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
121
click to vote
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
131
click to vote
COGSCI
2008
14 years 12 months ago
2008
This article demonstrates the potential of using hierarchical Bayesian methods to relate models and data in the cognitive sciences. This is done using a worked example that consid...
119
click to vote
ICMLA
2009
14 years 11 months ago
2009
In sequential decision making under uncertainty, as in many other modeling endeavors, researchers observe a dynamical system and collect data measuring its behavior over time. The...