1027 search results - page 175 / 206 » Progress on the Progressive Party Problem |
APPROX
2011
Springer
13 years 9 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
DAWAK
2011
Springer
13 years 9 months ago
2011
Springer
(The original conference version of this paper mischaracterizes the contributions of the current authors, relative to the contributions of Keogh et al. [11, 12]. We would like to ...
157
click to vote
SDM
2012
SIAM
13 years 3 days ago
2012
SIAM
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
120
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
This paper proposes a novel approach to motion capture
from multiple, synchronized video streams, specifically
aimed at recording dense and accurate models of the structure
and ...
107
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
...