1326 search results - page 37 / 266 » Approximate Tree Kernels |
121
click to vote
NAACL
2010
14 years 11 months ago
2010
Opinion holder extraction is one of the important subtasks in sentiment analysis. The effective detection of an opinion holder depends on the consideration of various cues on vari...
124
click to vote
AAAI
2010
15 years 3 months ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
139
click to vote
COCOA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
138
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
113
click to vote
RECOMB
1997
Springer
15 years 6 months ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...