Sciweavers

1723 search results - page 24 / 345
» Cycling in linear programming problems
Sort
View
ICML
2003
IEEE
14 years 10 months ago
Linear Programming Boosting for Uneven Datasets
The paper extends the notion of linear programming boosting to handle uneven datasets. Extensive experiments with text classification problem compare the performance of a number o...
Jure Leskovec, John Shawe-Taylor
TR
2008
117views more  TR 2008»
13 years 9 months ago
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
Alain Billionnet
PARA
1995
Springer
14 years 1 months ago
Decomposing Linear Programs for Parallel Solution
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
Ali Pinar, Ümit V. Çatalyürek, Ce...
ICDAR
2009
IEEE
13 years 7 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
SWAT
1994
Springer
130views Algorithms» more  SWAT 1994»
14 years 1 months ago
Dominating Cliques in Distance-Hereditary Graphs
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
Feodor F. Dragan