Sciweavers

1071 search results - page 52 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
ESOP
2008
Springer
13 years 10 months ago
Semi-persistent Data Structures
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
Sylvain Conchon, Jean-Christophe Filliâtre
NAR
2007
124views more  NAR 2007»
13 years 7 months ago
The RNAz web server: prediction of thermodynamically stable and evolutionarily conserved RNA structures
Many non-coding RNA genes and cis-acting regulatory elements of mRNAs contain RNA secondary structures that are critical for their function. Such functional RNAs can be predicted ...
Andreas R. Gruber, Richard Neuböck, Ivo L. Ho...
PAMI
1998
85views more  PAMI 1998»
13 years 7 months ago
Shape Evolution With Structural and Topological Changes Using Blending
This paper describes a framework for the estimation of shape from sparse or incomplete range data. It uses a shape representation called blending, which allows for the geometric c...
Douglas DeCarlo, Dimitris N. Metaxas
QSHINE
2005
IEEE
14 years 1 months ago
Adaptive Low-Complexity Erasure-Correcting Code-Based Protocols for QoS-Driven Mobile Multicast Services
—We propose an adaptive hybrid automatic repeat request–forward error correction (ARQ–FEC) erasure-correcting scheme for quality of service (QoS)-driven mobile multicast serv...
Qinghe Du, Xi Zhang
EUROSYS
2011
ACM
12 years 11 months ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues