Sciweavers

2373 search results - page 164 / 475
» Complexities for generalized models of self-assembly
Sort
View
LICS
2006
IEEE
16 years 15 days ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
UAI
2004
15 years 7 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
ICANN
2010
Springer
15 years 6 months ago
Computational Properties of Probabilistic Neural Networks
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
Jiri Grim, Jan Hora
VISUALIZATION
2002
IEEE
15 years 11 months ago
Geometric Surface Smoothing via Anisotropic Diffusion of Normals
This paper introduces a method for smoothing complex, noisy surfaces, while preserving (and enhancing) sharp, geometric features. It has two main advantages over previous approach...
Tolga Tasdizen, Ross T. Whitaker, Paul Burchard, S...
ISSTA
2012
ACM
13 years 9 months ago
A quantitative study of accuracy in system call-based malware detection
Over the last decade, there has been a significant increase in the number and sophistication of malware-related attacks and infections. Many detection techniques have been propos...
Davide Canali, Andrea Lanzi, Davide Balzarotti, Ch...