7006 search results - page 172 / 1402 » Approximation Algorithms |
142
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
143
click to vote
TSMC
2010
14 years 9 months ago
2010
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
172
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
144
click to vote
UAI
1997
15 years 4 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...