Sciweavers

131 search results - page 7 / 27
» A General Method for Reducing the Complexity of Relational I...
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
BMCBI
2005
122views more  BMCBI 2005»
13 years 7 months ago
A neural strategy for the inference of SH3 domain-peptide interaction specificity
Background: The SH3 domain family is one of the most representative and widely studied cases of so-called Peptide Recognition Modules (PRM). The polyproline II motif PxxP that gen...
Enrico Ferraro, Allegra Via, Gabriele Ausiello, Ma...
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 8 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
BMVC
2010
13 years 5 months ago
Generalized RBF feature maps for Efficient Detection
Kernel methods yield state-of-the-art performance in certain applications such as image classification and object detection. However, large scale problems require machine learning...
Sreekanth Vempati, Andrea Vedaldi, Andrew Zisserma...
ADL
2000
Springer
284views Digital Library» more  ADL 2000»
14 years 2 days ago
A Boolean Query Processing with a Result Cache in Mediator Systems
A mediator system is a kind of a meta-search engine that provides a seamlessly integrated search service for diverse search engines (collections). Since collections of a mediator ...
Jae-Heon Cheong, Sang-goo Lee