Sciweavers

4860 search results - page 132 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
COCOON
2007
Springer
14 years 4 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang
GLOBECOM
2007
IEEE
14 years 4 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
EUROPAR
2010
Springer
13 years 10 months ago
Analysis of Multi-Organization Scheduling Algorithms
Abstract. In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Probl...
Johanne Cohen, Daniel Cordeiro, Denis Trystram, Fr...
COMPSAC
2002
IEEE
14 years 3 months ago
Object Identification in Legacy Code as a Grouping Problem
Maintenance is undoubtedly the most effort-consuming activity in software production whereby the entropy of legacy systems (e.g., due to redundancies, poor modularity and lack of ...
Houari A. Sahraoui, Petko Valtchev, Idrissa Konkob...
IPL
2010
71views more  IPL 2010»
13 years 8 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson