Sciweavers

4843 search results - page 348 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
SIAMDM
2010
75views more  SIAMDM 2010»
14 years 11 months ago
An Efficient Sparse Regularity Concept
Let A be a 0/1 matrix of size m
Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze
EUROCOLT
1999
Springer
15 years 8 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
FOCS
2004
IEEE
15 years 8 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
IPCO
2010
160views Optimization» more  IPCO 2010»
15 years 5 months ago
On Column-Restricted and Priority Covering Integer Programs
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
Deeparnab Chakrabarty, Elyot Grant, Jochen Kö...
UAI
2004
15 years 5 months ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...