Sciweavers

1376 search results - page 149 / 276
» Searching Trees: An Essay
Sort
View
IJCAI
2007
15 years 7 months ago
Extracting Propositional Rules from Feed-forward Neural Networks - A New Decompositional Approach
In this paper, we present a new decompositional approach for the extraction of propositional rules from feed-forward neural networks of binary threshold units. After decomposing t...
Sebastian Bader, Steffen Hölldobler, Valentin...
AMAST
2010
Springer
15 years 1 months ago
A Complete Declarative Debugger for Maude
Abstract. We present a declarative debugger for Maude specifications that allows to debug wrong answers (a wrong result is obtained) and missing answers (a correct but incomplete r...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
VLDB
1999
ACM
118views Database» more  VLDB 1999»
15 years 10 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
CP
2004
Springer
15 years 12 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 11 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...