1389 search results - page 259 / 278 » Improved Approximation Algorithms for Label Cover Problems |
108
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
In recent years, large databases of natural images have
become increasingly popular in the evaluation of face and
object recognition algorithms. However, Pinto et al. previously
...
WSDM
2012
ACM
13 years 5 months ago
2012
ACM
It is well known that different types of social ties have essentially different influence between people. However, users in online social networks rarely categorize their contact...
100
click to vote
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
Most traditional text clustering methods are based on "bag of words" (BOW) representation based on frequency statistics in a set of documents. BOW, however, ignores the ...
101
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...