6300 search results - page 1197 / 1260 » We have it easy, but do we have it right |
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
105
Voted
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
107
click to vote
SIAMCOMP
2008
15 years 20 days ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
111
click to vote
NAR
1998
15 years 12 days ago
1998
The eighth edition of the haemophilia B database (http://www.umds.ac.uk/molgen/haemBdatabase.htm ) lists in an easily accessible form all known factor IX mutations due to small ch...
107
click to vote
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
The use of image patches to capture local correlations between pixels has been growing in popularity for use in various low-level vision tasks. There is a trade-off between using ...