2168 search results - page 196 / 434 » Randomized Algorithms and Complexity Theory |
132
Voted
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
126
Voted
INDOCRYPT
2001
Springer
15 years 8 months ago
2001
Springer
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
161
Voted
ACID
2006
15 years 5 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
128
Voted
PAMI
2010
15 years 2 months ago
2010
—We propose a unified graphical model that can represent both the causal and noncausal relationships among random variables and apply it to the image segmentation problem. Specif...
110
Voted
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...