Sciweavers

537 search results - page 15 / 108
» Complete Performance Graphs in Probabilistic Information Ret...
Sort
View
AI
2011
Springer
13 years 2 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
CLEF
2009
Springer
13 years 8 months ago
Multilingual Query Expansion for CLEF Adhoc-TEL
In this paper we will briefly describe the approaches taken by the Cheshire (Berkeley) Group for the CLEF Adhoc-TEL 2009 tasks (Mono and Bilingual retrieval). Recognizing that man...
Ray R. Larson
SIGIR
2003
ACM
14 years 28 days ago
XML retrieval: what to retrieve?
The fundamental difference between standard information retrieval and XML retrieval is the unit of retrieval. In traditional IR, the unit of retrieval is fixed: it is the comple...
Jaap Kamps, Maarten Marx, Maarten de Rijke, Bö...
ICASSP
2008
IEEE
14 years 2 months ago
Probabilistic framework for gene expression clustering validation based on gene ontology and graph theory
Based on the correlation between expression and ontologydriven gene similarity, we incorporate functional annotations into gene expression clustering validation. A probabilistic f...
Yinyin Yuan, Chang-Tsun Li
SPIRE
2005
Springer
14 years 1 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez