Sciweavers

3367 search results - page 508 / 674
» Incremental assignment problem
Sort
View
COLT
2010
Springer
15 years 4 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
MCS
2010
Springer
15 years 4 months ago
Improving Multilabel Classification Performance by Using Ensemble of Multi-label Classifiers
Multilabel classification is a challenging research problem in which each instance is assigned to a subset of labels. Recently, a considerable amount of research has been concerned...
Muhammad Atif Tahir, Josef Kittler, Krystian Mikol...
WINE
2010
Springer
178views Economy» more  WINE 2010»
15 years 4 months ago
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
Patrick Briest, Parinya Chalermsook, Sanjeev Khann...
HCI
2009
15 years 4 months ago
A Similarity Measure for Vision-Based Sign Recognition
When we encounter an English word that we do not understand, we can look it up in a dictionary. However, when an American Sign Language (ASL) user encounters an unknown sign, looki...
Haijing Wang, Alexandra Stefan, Vassilis Athitsos
DISOPT
2011
210views Education» more  DISOPT 2011»
15 years 1 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider