9842 search results - page 426 / 1969 » The Complexity of the Matching-Cut Problem |
160
click to vote
IANDC
2007
15 years 4 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
145
click to vote
JC
2007
15 years 4 months ago
2007
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
117
click to vote
TOG
2008
15 years 4 months ago
2008
Robust treatment of complex collisions is a challenging problem in cloth simulation. Some state of the art methods resolve collisions iteratively, invoking a fail-safe when a boun...
137
click to vote
JIPS
2007
15 years 4 months ago
2007
: We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equa...
149
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...