455 search results - page 43 / 91 » Approximation Algorithms for Partial Covering Problems |
100
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Large margin learning of Continuous Density HMMs with a partially labeled dataset has been extensively studied in the speech and handwriting recognition fields. Yet due to the non...
85
Voted
HEURISTICS
2006
14 years 9 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
SODA
2012
ACM
13 years 1 days ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
102
click to vote
SIAMSC
2008
14 years 9 months ago
2008
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...