Sciweavers

2517 search results - page 291 / 504
» Specifying Weak Sets
Sort
View
SIAMMA
2011
97views more  SIAMMA 2011»
14 years 9 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...
STACS
2009
Springer
16 years 1 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
BTW
2007
Springer
142views Database» more  BTW 2007»
16 years 25 days ago
Getting Prime Cuts from Skylines over Partially Ordered Domains
: Skyline queries have recently received a lot of attention due to their intuitive query formulation: users can state preferences with respect to several attributes. Unlike numeric...
Wolf-Tilo Balke, Wolf Siberski, Ulrich Güntze...
INDOCRYPT
2005
Springer
16 years 5 days ago
On the Algebraic Immunity of Symmetric Boolean Functions
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...
An Braeken, Bart Preneel
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
15 years 11 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert