16430 search results - page 3062 / 3286 » On Computable Tree Functions |
124
click to vote
STOC
2009
ACM
15 years 9 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
109
Voted
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
130
Voted
ICS
2009
Tsinghua U.
15 years 9 months ago
2009
Tsinghua U.
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...
141
Voted
RECOMB
2009
Springer
15 years 9 months ago
2009
Springer
This paper presents a new approach to site-directed recombination, swapping combinations of selected discontiguous fragments from a source protein in place of corresponding fragmen...
134
Voted
STACS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...