3894 search results - page 554 / 779 » Approximation Algorithms for Biclustering Problems |
127
Voted
HVEI
2009
15 years 1 months ago
2009
The classical approach to converting colour to greyscale is to code the luminance signal as a grey value image. However, the problem with this approach is that the detail at equil...
201
click to vote
CANS
2011
Springer
14 years 3 months ago
2011
Springer
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
128
Voted
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
119
click to vote
JSSPP
2005
Springer
15 years 9 months ago
2005
Springer
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
132
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
In this work we investigate an inverse geometry problem. Given a light source, a diffuse plane and a caustic image, how must a geometric object look like (transmissive or reflect...