2137 search results - page 395 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
111
click to vote
STACS
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
113
click to vote
AAAI
2007
15 years 4 months ago
2007
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...
138
click to vote
IJACT
2008
15 years 1 months ago
2008
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
109
click to vote
DAC
2005
ACM
16 years 2 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
105
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...