Sciweavers

4324 search results - page 291 / 865
» A Generalized Representer Theorem
Sort
View
ICDT
2001
ACM
131views Database» more  ICDT 2001»
15 years 11 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
FM
1999
Springer
107views Formal Methods» more  FM 1999»
15 years 11 months ago
A Formalization of Software Architecture
Software architecture addresses the high level specification, design and analysis of software systems. Formal models can provide essential underpinning for architectural descripti...
John Herbert, Bruno Dutertre, Robert A. Riemenschn...
ASIAN
2006
Springer
134views Algorithms» more  ASIAN 2006»
15 years 10 months ago
Computational Soundness of Formal Indistinguishability and Static Equivalence
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
Gergei Bana, Payman Mohassel, Till Stegers
CCCG
2010
15 years 8 months ago
On the variance of random polygons
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...
William L. Steiger, Imre Bárány
IICAI
2007
15 years 8 months ago
Topologically Continuous Associative Memory: A Theoretical Foundation
We introduce a neural network with associative memory and a continuous topology, i.e. its processing units are elements of a continuous metric space and the state space is Euclide...
Enrique Carlos Segura