Sciweavers

2223 search results - page 376 / 445
» Ontological Framework for Approximation
Sort
View
STACS
1999
Springer
15 years 5 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
KDD
1998
ACM
170views Data Mining» more  KDD 1998»
15 years 5 months ago
Mining Audit Data to Build Intrusion Detection Models
In this paper we discuss a data mining framework for constructing intrusion detection models. The key ideas are to mine system audit data for consistent and useful patterns of pro...
Wenke Lee, Salvatore J. Stolfo, Kui W. Mok
RT
1998
Springer
15 years 5 months ago
Image-Based Rendering for Non-Diffuse Synthetic Scenes
Most current image-based rendering methods operate under the assumption that all of the visible surfaces in the scene are opaque ideal diffuse (Lambertian) reflectors. This paper i...
Dani Lischinski, Ari Rappoport
122
Voted
AGP
1996
IEEE
15 years 5 months ago
Modular Analysis of Suspension Free cc Programs
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
Enea Zaffanella
110
Voted
EMMCVPR
1997
Springer
15 years 5 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann