Sciweavers

6045 search results - page 1102 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
RECOMB
2000
Springer
14 years 22 days ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal
SIGGRAPH
2000
ACM
14 years 22 days ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
CAIP
1995
Springer
137views Image Analysis» more  CAIP 1995»
14 years 22 days ago
Extending the Point Distribution Model Using Polar Coordinates
The Point Distribution Model (PDM) has already proved useful for many tasks involving the location or tracking of deformable objects. A principal limitation lies in the fact that n...
Tony Heap, David Hogg
EUROCRYPT
1997
Springer
14 years 22 days ago
A Secure and Optimally Efficient Multi-Authority Election Scheme
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the ...
Ronald Cramer, Rosario Gennaro, Berry Schoenmakers
SPIN
2000
Springer
14 years 22 days ago
The Temporal Rover and the ATG Rover
The Temporal Rover is a specification based verification tool for applications written in C, C++, Java, Verilog and VHDL. The tool combines formal specification, using Linear-Time ...
Doron Drusinsky
« Prev « First page 1102 / 1209 Last » Next »