1326 search results - page 127 / 266 » Approximate Tree Kernels |
108
click to vote
NIPS
2004
15 years 3 months ago
2004
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...
135
click to vote
SIAMCOMP
2000
15 years 2 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
145
Voted
ALGORITHMICA
1998
15 years 2 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
135
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
141
Voted
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...