329 search results - page 55 / 66 » An algorithm for recognition of n-collapsing words |
142
click to vote
STOC
2000
ACM
15 years 4 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
KDD
2005
ACM
16 years 11 days ago
2005
ACM
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
CHI
2003
ACM
16 years 9 days ago
2003
ACM
We propose a method for computer-based speed writing, SHARK (shorthand aided rapid keyboarding), which augments stylus keyboarding with shorthand gesturing. SHARK defines a shorth...
PAKDD
2009
ACM
15 years 6 months ago
2009
ACM
Abstract. An object o of a database D is called a hot item, if there is a sufficiently large population of other objects in D that are similar to o. In other words, hot items are ...
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We propose new ideas and efficient algorithms towards bridging the gap between bag-of-features and constellation descriptors for image matching. Specifically, we show ho...