Sciweavers

2702 search results - page 328 / 541
» Practically Applicable Formal Methods
Sort
View
106
Voted
FOCM
2011
107views more  FOCM 2011»
14 years 6 months ago
Quantifying Transversality by Measuring the Robustness of Intersections
By definition, transverse intersections are stable under infinitesimal perturbations. Using persistent homology, we extend this notion to a measure. Given a space of perturbatio...
Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Pat...
AIME
2011
Springer
14 years 2 months ago
The FMA in OWL 2
Representing the Foundational Model of Anatomy (FMA) in OWL 2 is essential for semantic interoperability. The paper describes the method and tool used to formalize the FMA in OWL 2...
Christine Golbreich, Julien Grosjean, Stéfa...
CORR
2011
Springer
265views Education» more  CORR 2011»
14 years 6 months ago
Signal Processing in Large Systems: a New Paradigm
—For a long time, signal processing applications, and most particularly detection and parameter estimation methods, have relied on the limiting behaviour of test statistics and e...
Romain Couillet, Mérouane Debbah
123
Voted
IACR
2011
136views more  IACR 2011»
14 years 2 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
104
Voted
CIDM
2007
IEEE
15 years 6 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...