Sciweavers

494 search results - page 41 / 99
» Optimal Carpet Cutting
Sort
View
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 3 months ago
Analysis and Improvements of the Adaptive Discretization Intervals Knowledge Representation
In order to handle classification problems with real-valued attributes using discretization algorithms it is necessary to obtain a good and reduced set of cut points in order to l...
Jaume Bacardit, Josep Maria Garrell i Guiu
CC
2007
Springer
157views System Software» more  CC 2007»
14 years 4 months ago
New Algorithms for SIMD Alignment
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
Liza Fireman, Erez Petrank, Ayal Zaks
MP
2006
142views more  MP 2006»
13 years 9 months ago
Exploring the Relationship Between Max-Cut and Stable Set Relaxations
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
Monia Giandomenico, Adam N. Letchford
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 10 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
CVPR
2010
IEEE
14 years 6 months ago
Geodesic Graph Cut for Interactive Image Segmentation
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
Brian Price, Bryan Morse, Scott Cohen