1092 search results - page 112 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
152
click to vote
IJCAI
1997
15 years 7 months ago
1997
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
173
Voted
SODA
2000
ACM
15 years 7 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
203
click to vote
NIPS
2001
15 years 7 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
156
click to vote
TIP
2008
15 years 6 months ago
2008
This paper presents a connected coherence tree algorithm (CCTA) for image segmentation with no prior knowledge. It aims to find regions of semantic coherence based on the proposed ...
134
click to vote
CAEPIA
2007
Springer
15 years 10 months ago
2007
Springer
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...