4112 search results - page 99 / 823 » Efficient Algorithms for the Spoonerism Problem |
152
click to vote
FAW
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
123
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
143
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
126
click to vote
ISPD
1998
ACM
15 years 8 months ago
1998
ACM
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...
154
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
—The terrorist attacks on September 11, 2001 have drawn attention to the use of wireless technology in order to locate survivors of structural collapse. We propose to construct a...