Sciweavers

187 search results - page 26 / 38
» Bounding the cost of learned rules
Sort
View
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
13 years 12 months ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
ASPDAC
2007
ACM
123views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Coupling-aware Dummy Metal Insertion for Lithography
As integrated circuits manufacturing technology is advancing into 65nm and 45nm nodes, extensive resolution enhancement techniques (RETs) are needed to correctly manufacture a chip...
Liang Deng, Martin D. F. Wong, Kai-Yuan Chao, Hua ...
ICCV
2009
IEEE
15 years 10 days ago
Level Set Segmentation with Both Shape and Intensity Priors
We present a new variational level-set-based segmentation formulation that uses both shape and intensity prior information learned from a training set. By applying Bayes’ rule...
Siqi Chen and Richard J. Radke
INFOCOM
2009
IEEE
14 years 2 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...