1871 search results - page 79 / 375 » The Ephemeral Pairing Problem |
148
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
193
click to vote
PAIRING
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
179
click to vote
IJCNLP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We present a new implication of Wu’s (1997) Inversion Transduction Grammar (ITG) Hypothesis, on the problem of retrieving truly parallel sentence translations from larg...
164
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
205
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...