Sciweavers

1795 search results - page 166 / 359
» Search by strategy
Sort
View
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
16 years 3 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
SWAP
2008
15 years 8 months ago
Improving Retrieval Experience Exploiting Semantic Representation of Documents
The traditional strategy performed by Information Retrieval (IR) systems is ranked keyword search: for a given query, a list of documents, ordered by relevance, is returned. Releva...
Pierpaolo Basile, Annalina Caputo, Anna Lisa Genti...
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 10 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
ACMSE
2004
ACM
15 years 12 months ago
Distributed robotic target acquisition using Bluetooth communication
This paper presents a distributed multi-robot system designed to solve a team-based search and destroy task. The project was divided into two phases. The initial phase was used to...
J. T. McClain, Bradley J. Wimpey, D. H. Barnhard, ...
IPPS
2000
IEEE
15 years 11 months ago
Parallel Computation for Chromosome Reconstruction on a Cluster of Workstations
Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is...
Suchendra M. Bhandarkar, Salem Machaka, Sanjay She...