Sciweavers

3044 search results - page 360 / 609
» Linear logical approximations
Sort
View
JMLR
2010
129views more  JMLR 2010»
15 years 1 months ago
Expectation Truncation and the Benefits of Preselection In Training Generative Models
We show how a preselection of hidden variables can be used to efficiently train generative models with binary hidden variables. The approach is based on Expectation Maximization (...
Jörg Lücke, Julian Eggert
SIAMNUM
2010
150views more  SIAMNUM 2010»
15 years 1 months ago
Quasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
We analyze an adaptive discontinuous finite element method (ADFEM) for symmetric second order linear elliptic operators. The method is formulated on nonconforming meshes made of si...
Andrea Bonito, Ricardo H. Nochetto
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
16 years 8 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa
ASAP
1997
IEEE
144views Hardware» more  ASAP 1997»
15 years 11 months ago
Automatic data mapping of signal processing applications
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
Corinne Ancourt, Denis Barthou, Christophe Guettie...
PPDP
2000
Springer
15 years 10 months ago
Enhanced sharing analysis techniques: a comprehensive evaluation
an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of tech...
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill