4047 search results - page 169 / 810 » Some Properties and Some Problems on Set Functors |
184
click to vote
JCSS
2002
15 years 6 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
179
click to vote
FSTTCS
2007
Springer
16 years 14 days ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
117
click to vote
FLAIRS
2007
15 years 8 months ago
2007
Recent work highlights advantages in decomposing multiclass decision problems into multiple binary problems. Several strategies have been proposed for this decomposition. The most...
156
click to vote
BCSHCI
2007
15 years 7 months ago
2007
Eye-tracking research is increasingly used to supplement usability tests in both commercial and academic practice. However, while there has been research into links between eyetra...
150
click to vote
IJAC
2007
15 years 6 months ago
2007
In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions C (1/6) and C (1/4) − T (4) has the property that...