Sciweavers

1285 search results - page 217 / 257
» On the Complexity of Ordinal Clustering
Sort
View
FQAS
2004
Springer
146views Database» more  FQAS 2004»
13 years 11 months ago
Discovering Representative Models in Large Time Series Databases
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
Simona E. Rombo, Giorgio Terracina
FPL
2006
Springer
242views Hardware» more  FPL 2006»
13 years 11 months ago
TMD-MPI: An MPI Implementation for Multiple Processors Across Multiple FPGAs
With current FPGAs, designers can now instantiate several embedded processors, memory units, and a wide variety of IP blocks to build a single-chip, high-performance multiprocesso...
Manuel Saldaña, Paul Chow
GCB
2006
Springer
99views Biometrics» more  GCB 2006»
13 years 11 months ago
Shape Distributions and Protein Similarity
: In this paper we describe a similarity model that provides the objective basis for clustering proteins of similar structure. More specifically, we consider the following variant ...
Stefan Canzar, Jan Remy
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
13 years 11 months ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis
EURODAC
1995
IEEE
202views VHDL» more  EURODAC 1995»
13 years 11 months ago
Hardware-software co-synthesis of fault-tolerant real-time distributed embedded systems
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
Santhanam Srinivasan, Niraj K. Jha