Sciweavers

2218 search results - page 170 / 444
» Testing Expressibility Is Hard
Sort
View
206
Voted
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
16 years 2 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
CAD
2008
Springer
15 years 27 days ago
Geometrically exact dynamic splines
In this paper, we propose a complete model handling the physical simulation of deformable 1D objects. We formulate continuous expressions for stretching, bending and twisting ener...
Adrien Theetten, Laurent Grisoni, Claude Andriot, ...
97
Voted
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 27 days ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
95
Voted
ENTCS
2008
120views more  ENTCS 2008»
15 years 26 days ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier
111
Voted
DAM
2007
91views more  DAM 2007»
15 years 23 days ago
Integer linear programming approaches for non-unique probe selection
In addition to their prevalent use for analyzing gene expression, DNA microarrays are an efficient tool for biological, medical, and industrial applications because of their abil...
Gunnar W. Klau, Sven Rahmann, Alexander Schliep, M...