543 search results - page 58 / 109 » New Upper Bounds for MaxSat |
DCG
2007
14 years 9 months ago
2007
Given a sphere of any radius r in an n-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the...
ORDER
2007
14 years 9 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
100
click to vote
JMLR
2012
13 years 5 days ago
2012
We propose a new family of latent variable models called max-margin min-entropy (m3e) models, which define a distribution over the output and the hidden variables conditioned on ...