Sciweavers

54 search results - page 7 / 11
» An Algorithm for Solving the Discrete Log Problem on Hyperel...
Sort
View
EUROCRYPT
2003
Springer
14 years 21 days ago
CAPTCHA: Using Hard AI Problems for Security
We introduce captcha, an automated test that humans can pass, but current computer programs can’t pass: any program that has high success over a captcha can be used to solve an u...
Luis von Ahn, Manuel Blum, Nicholas J. Hopper, Joh...
COMPGEOM
2010
ACM
14 years 17 days ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
CORR
2007
Springer
143views Education» more  CORR 2007»
13 years 7 months ago
An Approximation Algorithm for Shortest Descending Paths
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Anna Lubiw
CPM
2007
Springer
99views Combinatorics» more  CPM 2007»
14 years 1 months ago
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
14 years 4 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...