283 search results - page 9 / 57 » Deterministic Polynomial Time Algorithms for Matrix Completi... |
112
Voted
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study the calibration problem in circular ultrasound tomography devices for breast imaging, where the sensor positions deviate from the circumference of a perfect circle. We in...
103
Voted
CSR
2009
Springer
15 years 6 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
MICS
2010
14 years 10 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
172
click to vote
FOSSACS
2011
Springer
14 years 3 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...