2354 search results - page 247 / 471 » Randomness, Stochasticity and Approximations |
147
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
138
click to vote
EMNLP
2006
15 years 7 months ago
2006
We propose a conditional random fieldbased method for supertagging, and apply it to the task of learning new lexical items for HPSG-based precision grammars of English and Japanes...
184
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
140
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
176
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...