1041 search results - page 26 / 209 » Randomizing Reductions of Search Problems |
90
Voted
COCOON
1998
Springer
15 years 6 months ago
1998
Springer
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
130
click to vote
FOCS
2004
IEEE
15 years 6 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 ...
117
click to vote
SLS
2009
Springer
15 years 8 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
123
click to vote
ADC
2006
Springer
15 years 8 months ago
2006
Springer
Searching bio-chemical structures is becoming an important application domain of information retrieval. This paper introduces a protein structure matching problem and formulates i...
137
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
We consider the problem of classification of a pattern from multiple compressed observations that are collected in a sensor network. In particular, we exploit the properties of r...