3894 search results - page 291 / 779 » Approximation Algorithms for Biclustering Problems |
196
click to vote
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
133
click to vote
ANOR
2007
15 years 6 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
191
click to vote
VLDB
2004
ACM
16 years 5 hour ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
173
click to vote
ECCV
2006
Springer
15 years 10 months ago
2006
Springer
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
176
click to vote
FSTTCS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...