Sciweavers

1709 search results - page 9 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
NIPS
2003
15 years 1 months ago
An MCMC-Based Method of Comparing Connectionist Models in Cognitive Science
Despite the popularity of connectionist models in cognitive science, their performance can often be difficult to evaluate. Inspired by the geometric approach to statistical model ...
Woojae Kim, Daniel J. Navarro, Mark A. Pitt, In Ja...
BTW
2005
Springer
118views Database» more  BTW 2005»
15 years 5 months ago
The MINERVA Project: Database Selection in the Context of P2P Search
: This paper presents the MINERVA project that protoypes a distributed search engine based on P2P techniques. MINERVA is layered on top of a Chord-style overlay network and uses a ...
Matthias Bender, Sebastian Michel, Gerhard Weikum,...
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
15 years 11 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...
ICPR
2004
IEEE
16 years 22 days ago
Selecting Models from Videos for Appearance-Based Face Recognition
In this paper, we propose an unsupervised approach to select representative face samples (models) from raw videos and build an appearance-based face recognition system. The approa...
Abdenour Hadid, Matti Pietikäinen
KDD
2002
ACM
196views Data Mining» more  KDD 2002»
16 years 1 days ago
Comparing Two Recommender Algorithms with the Help of Recommendations by Peers
Abstract. Since more and more Web sites, especially sites of retailers, offer automatic recommendation services using Web usage mining, evaluation of recommender algorithms has bec...
Andreas Geyer-Schulz, Michael Hahsler