740 search results - page 91 / 148 » An approximation ratio for biclustering |
TIT
2002
14 years 11 months ago
2002
This paper proves large-system asymptotic normality of the output of a family of linear multiuser receivers that can be arbitrarily well approximated by polynomial receivers. This ...
112
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
TOC
2008
14 years 11 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
IPMI
2005
Springer
16 years 21 days ago
2005
Springer
In this paper, we study Markov Random Fields as spatial smoothing priors in fMRI detection. Relatively high noise in fMRI images presents a serious challenge for the detection algo...