Sciweavers

313 search results - page 57 / 63
» Formalizing the Halting Problem in a Constructive Type Theor...
Sort
View
JMLR
2010
145views more  JMLR 2010»
13 years 2 months ago
Parallelizable Sampling of Markov Random Fields
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Netwo...
James Martens, Ilya Sutskever
PLDI
2006
ACM
14 years 1 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
ICIP
2001
IEEE
14 years 9 months ago
Synthesis and applications of lattice image operators based on fuzzy norms
In this paper we use concepts from the lattice-based theory of morphological operators and fuzzy sets to develop generalized lattice image operators that can be expressed as nonli...
Petros Maragos, Vassilis Tzouvaras, Giorgos B. Sta...
SMI
2006
IEEE
135views Image Analysis» more  SMI 2006»
14 years 1 months ago
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
Bruno Lévy
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
14 years 1 months ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Michael Yu Zhu, Lei Liu