Sciweavers

1091 search results - page 162 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
WABI
2005
Springer
124views Bioinformatics» more  WABI 2005»
14 years 1 months ago
Reconstructing Metabolic Networks Using Interval Analysis
Recently, there has been growing interest in the modelling and simulation of biological systems. Such systems are often modelled in terms of coupled ordinary differential equation...
Warwick Tucker, Vincent Moulton
SIGMETRICS
2004
ACM
115views Hardware» more  SIGMETRICS 2004»
14 years 1 months ago
Emulating low-priority transport at the application layer: a background transfer service
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
Peter B. Key, Laurent Massoulié, Bing Wang
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
14 years 11 days ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani
EUROCAST
2007
Springer
126views Hardware» more  EUROCAST 2007»
14 years 2 months ago
Determining Orbital Elements of Extrasolar Planets by Evolution Strategies
After the detection of the first extrasolar planet (exoplanet) more than one decade ago we currently know about more than 200 planets around other stars and there are about twenty...
Andreas M. Chwatal, Günther R. Raidl
EMMCVPR
1997
Springer
14 years 7 days ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann