Sciweavers

70 search results - page 6 / 14
» An Exact Characterization of Greedy Structures
Sort
View
NIPS
1994
14 years 10 months ago
Factorial Learning and the EM Algorithm
Many real world learning problems are best characterized by an interaction of multiple independent causes or factors. Discovering such causal structure from the data is the focus ...
Zoubin Ghahramani
BIRTHDAY
2003
Springer
15 years 2 months ago
Petri Net Analysis Using Invariant Generation
Abstract. Petri nets have been widely used to model and analyze concurrent systems. Their wide-spread use in this domain is, on one hand, facilitated by their simplicity and expres...
Sriram Sankaranarayanan, Henny Sipma, Zohar Manna
GECCO
2009
Springer
15 years 1 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom
ICML
2010
IEEE
14 years 10 months ago
Submodular Dictionary Selection for Sparse Representation
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
Andreas Krause, Volkan Cevher
COCOON
2007
Springer
15 years 3 months ago
Seed-Based Exclusion Method for Non-coding RNA Gene Search
Given an RNA family characterized by conserved sequences and folding constraints, the problem is to search for all the instances of the RNA family in a genomic database. As seed-ba...
Jean-Eudes Duchesne, Mathieu Giraud, Nadia El-Mabr...