8512 search results - page 373 / 1703 » Computing Theory With Relevance |
185
click to vote
IJAR
2002
15 years 6 months ago
2002
We develop a decision-theoretic method that yields approximate, low cost troubleshooting plans by making more relevant observations and devoting more time to generate a plan. The ...
176
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
195
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
212
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
202
click to vote
MIR
2005
ACM
16 years 10 days ago
2005
ACM
In this paper, we propose a transductive learning method for content-based image retrieval: Multiple Random Walk (MRW). Its basic idea is to construct two generative models by mea...