Sciweavers

5210 search results - page 679 / 1042
» Exact geometric computation
Sort
View
BIOCOMP
2009
15 years 2 months ago
Gene Expression Analysis Using Communications, Coding and Information Theory Based Models
- Identification and annotation of all the functional elements in the genome, including genes and regulatory sequences, is a fundamental challenge in genomics and computational bio...
Mohammad Al Bataineh, Lun Huang, Ismaeel Muhamed, ...
JGO
2010
100views more  JGO 2010»
14 years 11 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
CVPR
2011
IEEE
14 years 8 months ago
Max-margin Clustering: Detecting Margins from Projections of Points on Lines
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
Raghuraman Gopalan, Jagan Sankaranarayanan
DISOPT
2011
175views Education» more  DISOPT 2011»
14 years 7 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük
ICCV
2011
IEEE
14 years 4 months ago
Tight Convex Relaxations for Vector-Valued Labeling Problems
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
Evgeny Strekalovskiy, Bastian Goldluecke, Daniel C...