530 search results - page 68 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...
TON
2008
13 years 7 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...