10 search results - page 1 / 2 » String Extension Learning Using Lattices |
LATA
2010
Springer
14 years 14 days ago
2010
Springer
STOC
2005
ACM
14 years 6 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
ICML
2002
IEEE
14 years 6 months ago
2002
IEEE
During the last years, the use of string kernels that compare documents has been shown to achieve good results on text classification problems. In this paper we introduce the appl...
KDD
2002
ACM
14 years 6 months ago
2002
ACM
The task of object identification occurs when integrating information from multiple websites. The same data objects can exist in inconsistent text formats across sites, making it ...
ICML
2005
IEEE
14 years 6 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...