6110 search results - page 142 / 1222 » Approximate Computing |
203
click to vote
ILP
2004
Springer
15 years 11 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
191
click to vote
CVPR
1997
IEEE
16 years 8 months ago
1997
IEEE
This paper presents an efficient algorithm for generating adaptive triangular meshes from dense range images. The proposed technique consists of two stages. First, a quadrilateral...
158
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
169
click to vote
EUROGP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. When researchers make alterations to the genetic programming algorithm they almost invariably wish to measure the change in performance of the evolutionary system. No one...
160
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...