20441 search results - page 315 / 4089 » Locally Computable Structures |
145
click to vote
PKDD
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
193
Voted
TAINN
2005
Springer
15 years 10 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
157
click to vote
SAGA
2001
Springer
15 years 9 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
124
Voted
AAAI
2008
15 years 7 months ago
2008
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...
123
click to vote
NIPS
2004
15 years 6 months ago
2004
We claim and present arguments to the effect that a large class of manifold learning algorithms that are essentially local and can be framed as kernel learning algorithms will suf...