Sciweavers

7167 search results - page 163 / 1434
» Answer Set Programming
Sort
View
ICASSP
2011
IEEE
13 years 29 days ago
Geometric programming for aggregation of binary classifiers
Multiclass classification problems are often decomposed into multiple binary problems that are solved by individual binary classifiers whose results are integrated into a final...
Sunho Park, Seungjin Choi
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
11 years 11 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
EOR
2008
99views more  EOR 2008»
13 years 9 months ago
Ordinal regression revisited: Multiple criteria ranking using a set of additive value functions
We present a new method, called UTAGMS , for multiple criteria ranking of alternatives from set A using a set of additive value functions which result from an ordinal regression. ...
Salvatore Greco, Vincent Mousseau, Roman Slowinski
BSL
2011
13 years 4 months ago
Combinatorial dichotomies in set theory
show that an abstract analysis of one of these three set theoretic principles can sometimes lead us to results that do not require additional axioms at all but which could have bee...
Stevo Todorcevic
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 9 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...