Sciweavers

861 search results - page 90 / 173
» Information landscapes and the analysis of search algorithms
Sort
View
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
15 years 13 days ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
IJIT
2004
15 years 12 days ago
IMDC: An Image-Mapped Data Clustering Technique for Large Datasets
In this paper, we present a new algorithm for clustering data in large datasets using image processing approaches. First the dataset is mapped into a binary image plane. The synthe...
Faruq A. Al-Omari, Nabeel I. Al-Fayoumi
COMPGEOM
2005
ACM
15 years 1 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
CLEF
2006
Springer
15 years 2 months ago
MorphoSaurus in ImageCLEF 2006: The Effect of Subwords On Biomedical IR
We here describe the subword approach we used in the 2006 ImageCLEF Medical Image Retrieval task. It is based on the assupmtion that neither fully inflected nor automatically stem...
Philipp Daumke, Jan Paetzold, Kornél G. Mar...
ICFCA
2007
Springer
15 years 5 months ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
Peggy Cellier, Sébastien Ferré, Oliv...