1326 search results - page 201 / 266 » Approximate Tree Kernels |
225
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
The skyline of a d-dimensional dataset consists of all points not dominated by others. The incorporation of the skyline operator into practical database systems necessitates an ef...
151
Voted
ALT
2006
Springer
16 years 8 days ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
120
click to vote
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
128
Voted
VISUALIZATION
1998
IEEE
15 years 7 months ago
1998
IEEE
Splatting is a fast volume rendering algorithm which achieves its speed by projecting voxels in the form of pre-integrated interpolation kernels, or splats. Presently, two main va...
201
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...