1941 search results - page 84 / 389 » On the Hardness of Approximate Reasoning |
164
click to vote
ESANN
2006
15 years 7 months ago
2006
Abstract. Feature Selection techniques usually follow some search strategy to select a suitable subset from a set of features. Most neural network growing algorithms perform a sear...
167
click to vote
UAI
2003
15 years 7 months ago
2003
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
151
click to vote
AAAI
2004
15 years 7 months ago
2004
We introduce anytime mechanisms for distributed optimization with self-interested agents. Anytime mechanisms retain good incentive properties even when interrupted before the opti...
144
click to vote
SIGECOM
2005
ACM
15 years 12 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
184
click to vote
ECCC
2008
15 years 6 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...