Sciweavers

1089 search results - page 176 / 218
» Bounds on generalized Frobenius numbers
Sort
View
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 3 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
COMPGEOM
2011
ACM
13 years 12 days ago
A generic algebraic kernel for non-linear geometric applications
We report on a generic uni- and bivariate algebraic kernel that is publicly available with Cgal 3.7. It comprises complete, correct, though efficient state-of-the-art implementati...
Eric Berberich, Michael Hemmer, Michael Kerber
CADE
2011
Springer
12 years 8 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
DAC
2012
ACM
11 years 11 months ago
A metric for layout-friendly microarchitecture optimization in high-level synthesis
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...
Jason Cong, Bin Liu
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 11 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich