Sciweavers

3359 search results - page 645 / 672
» A Simplified Idea Algorithm
Sort
View
SIGCOMM
2005
ACM
14 years 1 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
ECML
2005
Springer
14 years 1 months ago
Kernel Basis Pursuit
ABSTRACT. Estimating a non-uniformly sampled function from a set of learning points is a classical regression problem. Kernel methods have been widely used in this context, but eve...
Vincent Guigue, Alain Rakotomamonjy, Stépha...
EVOW
2005
Springer
14 years 1 months ago
Order Preserving Clustering over Multiple Time Course Experiments
Abstract. Clustering still represents the most commonly used technique to analyze gene expression data—be it classical clustering approaches that aim at finding biologically rel...
Stefan Bleuler, Eckart Zitzler
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 1 months ago
Evolutionary testing of state-based programs
The application of Evolutionary Algorithms to structural test data generation, known as Evolutionary Testing, has to date largely focused on programs with input-output behavior. H...
Phil McMinn, Mike Holcombe
ICDT
2005
ACM
124views Database» more  ICDT 2005»
14 years 1 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken