Sciweavers

16404 search results - page 770 / 3281
» A set coverage problem
Sort
View
IWPEC
2010
Springer
15 years 5 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
CVPR
2008
IEEE
16 years 9 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
ICML
2007
IEEE
16 years 8 months ago
Uncovering shared structures in multiclass classification
This paper suggests a method for multiclass learning with many classes by simultaneously learning shared characteristics common to the classes, and predictors for the classes in t...
Yonatan Amit, Michael Fink 0002, Nathan Srebro, Sh...
VLDB
2007
ACM
130views Database» more  VLDB 2007»
16 years 7 months ago
Model Management and Schema Mappings: Theory and Practice
We present an overview of a tutorial on model management--an approach to solving data integration problems, such as data warehousing, e-commerce, object-to-relational mapping, sch...
Philip A. Bernstein, Howard Ho
CPM
2009
Springer
122views Combinatorics» more  CPM 2009»
16 years 2 months ago
Haplotype Inference Constrained by Plausible Haplotype Data
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
Michael R. Fellows, Tzvika Hartman, Danny Hermelin...