Sciweavers

11808 search results - page 136 / 2362
» Isometries and Computability Structures
Sort
View
RECOMB
2002
Springer
16 years 4 months ago
Approximate matching of secondary structures
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
Nadia El-Mabrouk, Mathieu Raffinot
IPPS
2000
IEEE
15 years 9 months ago
Template Based Structured Collections
Collective operations on distributed data sets foster a high-level data-parallel programming style that eases many aspects of parallel programming significantly. In this paper we...
Jörg Nolte, Mitsuhisa Sato, Yutaka Ishikawa
COSIT
1997
Springer
143views GIS» more  COSIT 1997»
15 years 8 months ago
Using Hierarchical Spatial Data Structures for Hierarchical Spatial Reasoning
This paper gives a definition of Hierarchical Spatial Reasoning, which computes increasingly better results in a hierarchical fashion and stops the computation when a result is ac...
Sabine Timpf, Andrew U. Frank
TCS
2011
14 years 11 months ago
Correctness of linear logic proof structures is NL-complete
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
Paulin Jacobé de Naurois, Virgile Mogbil
SIAMMAX
2010
76views more  SIAMMAX 2010»
14 years 11 months ago
Matrix Structures and Parallel Algorithms for Image Superresolution Reconstruction
Computational resolution enhancement (superresolution) is generally regarded as a memory intensive process due to the large matrix-vector calculations involved. In this paper, a de...
Qiang Zhang, Richard T. Guy, Robert J. Plemmons