757 search results - page 99 / 152 » On the hardness of approximating Max-Satisfy |
100
click to vote
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
MIR
2010
ACM
15 years 4 months ago
2010
ACM
Typical tag recommendation systems for photos shared on social networks such as Flickr, use visual content analysis, collaborative filtering or personalization strategies to prod...
IPSN
2007
Springer
15 years 3 months ago
2007
Springer
Distributed computation of Voronoi cells in sensor networks, i.e. computing the locus of points in a sensor field closest to a given sensor, is a key building block that supports...
MLG
2007
Springer
15 years 3 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...