Sciweavers

1274 search results - page 170 / 255
» N-fold integer programming
Sort
View
NIPS
2008
13 years 9 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
NIPS
2004
13 years 9 months ago
Maximum Margin Clustering
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
Linli Xu, James Neufeld, Bryce Larson, Dale Schuur...
NIPS
2003
13 years 9 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini
ISMB
2000
13 years 9 months ago
A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations
The next phase of human genomics will involve largescale screens of populations for signi cant DNA polymorphisms, notably single nucleotide polymorphisms SNP's. Dense human S...
Dan Gusfield
COR
2008
99views more  COR 2008»
13 years 7 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi