4324 search results - page 611 / 865 » A Generalized Representer Theorem |
180
click to vote
JCDL
2010
ACM
15 years 11 months ago
2010
ACM
The“wisdom of crowds”is accomplishing tasks that are cumbersome for individuals yet cannot be fully automated by means of specialized computer algorithms. One such task is the...
171
click to vote
CW
2002
IEEE
15 years 11 months ago
2002
IEEE
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...
163
click to vote
WEBI
2001
Springer
15 years 11 months ago
2001
Springer
In the proposed data model for XML databases, an XML element is directly represented as a ground (variable-free) XML expression—a generalization of an XML element by incorporatio...
193
click to vote
DDEP
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...
233
click to vote
CPM
1998
Springer
15 years 11 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...