4112 search results - page 205 / 823 » Efficient Algorithms for the Spoonerism Problem |
204
Voted
SWAT
1992
Springer
15 years 10 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
192
click to vote
ACL
2010
15 years 4 months ago
2010
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
127
click to vote
GIS
2010
ACM
15 years 4 months ago
2010
ACM
We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result ...
156
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
130
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scale...