4112 search results - page 307 / 823 » Efficient Algorithms for the Spoonerism Problem |
202
click to vote
SAS
1994
Springer
15 years 11 months ago
1994
Springer
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
305
click to vote
GIS
2006
ACM
16 years 7 months ago
2006
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
144
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
173
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
207
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...