4112 search results - page 115 / 823 » Efficient Algorithms for the Spoonerism Problem |
139
click to vote
CC
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysi...
164
click to vote
AOR
2010
15 years 1 months ago
2010
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
145
click to vote
CATA
2004
15 years 5 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
121
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
We describe a new framework for globally solving the 3D-3D registration problem with unknown point correspondences. This problem is significant as it is frequently encountered in ...
114
click to vote
APWEB
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...