Sciweavers

3663 search results - page 20 / 733
» Problems in the ontology of computer programs
Sort
View
EMMCVPR
2011
Springer
12 years 8 months ago
Curvature Regularity for Multi-label Problems - Standard and Customized Linear Programming
Abstract. We follow recent work by Schoenemann et al. [25] for expressing curvature regularity as a linear program. While the original formulation focused on binary segmentation, w...
Thomas Schoenemann, Yubin Kuang, Fredrik Kahl
EOR
2007
70views more  EOR 2007»
13 years 8 months ago
Solving the maximum edge weight clique problem via unconstrained quadratic programming
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
Bahram Alidaee, Fred Glover, Gary A. Kochenberger,...
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 8 months ago
Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classificatio
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
Peter D. Turney
TAMC
2009
Springer
14 years 3 months ago
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...
Anke van Zuylen
FOCS
2010
IEEE
13 years 6 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin