4324 search results - page 718 / 865 » A Generalized Representer Theorem |
165
click to vote
CC
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. A key scalability challenge for interprocedural dataflow analysis comes from large libraries. Our work addresses this challenge for the general category of interprocedura...
132
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
161
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
The Web contains a large amount of documents and increasingly, also semantic data in the form of RDF triples. Many of these triples are annotations that are associated with docume...
132
click to vote
ASSETS
2005
ACM
15 years 6 months ago
2005
ACM
While strings and syntax trees are used by the Natural Language Processing community to represent the structure of spoken languages, these encodings are difficult to adapt to a si...
131
click to vote
CASES
2005
ACM
15 years 6 months ago
2005
ACM
Due to resource and power constraints, embedded processors often cannot afford dedicated floating-point units. For instance, the IBM PowerPC processor embedded in Xilinx Virtex-...