Sciweavers

1292 search results - page 25 / 259
» An Experimental Evaluation of the New OpenMP Tasking Model
Sort
View
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 1 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
CAV
2006
Springer
133views Hardware» more  CAV 2006»
15 years 5 months ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...
IJCNN
2006
IEEE
15 years 7 months ago
How Not to Evaluate a Developmental System
—Computational models of development aim to describe the mechanisms that underlie the acquisition of new skills or the emergence of new capabilities. The strength of a model is j...
Frederick Shic, Brian Scassellati
CLEF
2006
Springer
15 years 5 months ago
A Penalisation-Based Ranking Approach for the Mixed Monolingual Task of WebCLEF 2006
This paper presents an approach of a cross-lingual information retrieval which uses a ranking method based on a penalisation version of the Jaccard formula. The obtained results a...
David Pinto, Paolo Rosso, Ernesto Jiménez
CIKM
2006
Springer
15 years 3 months ago
Voting for candidates: adapting data fusion techniques for an expert search task
In an expert search task, the users' need is to identify people who have relevant expertise to a topic of interest. An expert search system predicts and ranks the expertise o...
Craig Macdonald, Iadh Ounis