Sciweavers

378 search results - page 70 / 76
» An objective evaluation criterion for clustering
Sort
View
SPIRE
2005
Springer
15 years 5 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
DEXAW
1999
IEEE
106views Database» more  DEXAW 1999»
15 years 4 months ago
Textual Similarities Based on a Distributional Approach
The design of efficient textual similarities is an important issue in the domain of textual data exploration. Textual similarities are for example central in document collection s...
Romaric Besançon, Martin Rajman, Jean-C&eac...
87
Voted
ICDCS
1997
IEEE
15 years 3 months ago
Predictable Network Computing
Clusters of networked, off-the-shelf workstations are currently used for computationintensive, parallel applications. However, it is hardly possible to predict the timing behaviou...
Andreas Polze, Gerhard Fohler, Matthias Werner
95
Voted
AMR
2008
Springer
248views Multimedia» more  AMR 2008»
15 years 1 months ago
Mobile Museum Guide Based on Fast SIFT Recognition
Abstract. This article explores the feasibility of a market-ready, mobile pattern recognition system based on the latest findings in the field of object recognition and currently a...
Boris Ruf, Effrosini Kokiopoulou, Marcin Detynieck...
CCGRID
2010
IEEE
15 years 23 days ago
A Map-Reduce System with an Alternate API for Multi-core Environments
Map-reduce framework has received a significant attention and is being used for programming both large-scale clusters and multi-core systems. While the high productivity aspect of ...
Wei Jiang, Vignesh T. Ravi, Gagan Agrawal