Sciweavers

5855 search results - page 395 / 1171
» Test generation and minimization with
Sort
View
CCO
2001
Springer
157views Combinatorics» more  CCO 2001»
15 years 11 months ago
Lagrangian Relaxation
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
Claude Lemaréchal
PVLDB
2010
97views more  PVLDB 2010»
15 years 5 months ago
Explaining Missing Answers to SPJUA Queries
This paper addresses the problem of explaining missing answers in queries that include selection, projection, join, union, aggregation and grouping (SPJUA). Explaining missing ans...
Melanie Herschel, Mauricio A. Hernández
NIPS
1997
15 years 8 months ago
Learning Generative Models with the Up-Propagation Algorithm
Up-propagation is an algorithm for inverting and learning neural network generative models. Sensory input is processed by inverting a model that generates patterns from hidden var...
Jong-Hoon Oh, H. Sebastian Seung
203
Voted
SSPR
2010
Springer
15 years 5 months ago
Information Theoretical Kernels for Generative Embeddings Based on Hidden Markov Models
Many approaches to learning classifiers for structured objects (e.g., shapes) use generative models in a Bayesian framework. However, state-of-the-art classifiers for vectorial d...
André F. T. Martins, Manuele Bicego, Vittor...
188
Voted
BMCBI
2010
144views more  BMCBI 2010»
15 years 7 months ago
Finding sRNA generative locales from high-throughput sequencing data with NiBLS
Background: Next-generation sequencing technologies allow researchers to obtain millions of sequence reads in a single experiment. One important use of the technology is the seque...
Daniel MacLean, Vincent Moulton, David J. Studholm...