Sciweavers

2370 search results - page 152 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
TACAS
2005
Springer
106views Algorithms» more  TACAS 2005»
15 years 3 months ago
Dependent Types for Program Understanding
Abstract. Weakly-typed languages such as Cobol often force programrepresent distinct data abstractions using the same low-level physical type. In this paper, we describe a techniqu...
Raghavan Komondoor, Ganesan Ramalingam, Satish Cha...
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
15 years 3 months ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...
WDAG
2005
Springer
92views Algorithms» more  WDAG 2005»
15 years 3 months ago
Plausible Clocks with Bounded Inaccuracy
In a distributed system with N processes, time stamps of size N (such as vector clocks) are necessary to accurately track potential causality between events. Plausible clocks are a...
Brad T. Moore, Paolo A. G. Sivilotti
ADBIS
2004
Springer
134views Database» more  ADBIS 2004»
15 years 3 months ago
Retrieval by Color Features in Image Databases
What is presented in this paper is our work in the area of image organization and retrieval in Image Databases using global color features and spatial color distribution of images....
Irena Valova, Boris Rachev
ASIAN
2004
Springer
109views Algorithms» more  ASIAN 2004»
15 years 3 months ago
Online Stochastic and Robust Optimization
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Russell Bent, Pascal Van Hentenryck