Sciweavers

4131 search results - page 253 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 6 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
AAAI
2010
15 years 5 months ago
Multi-Label Learning with Weak Label
Multi-label learning deals with data associated with multiple labels simultaneously. Previous work on multi-label learning assumes that for each instance, the "full" lab...
Yu-Yin Sun, Yin Zhang, Zhi-Hua Zhou
IJCAI
1989
15 years 5 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
134
Voted
ICALP
2005
Springer
15 years 9 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
TIP
1998
142views more  TIP 1998»
15 years 3 months ago
Inversion of large-support ill-posed linear operators using a piecewise Gaussian MRF
Abstract—We propose a method for the reconstruction of signals and images observed partially through a linear operator with a large support (e.g., a Fourier transform on a sparse...
Mila Nikolova, Jérôme Idier, Ali Moha...