Sciweavers

951 search results - page 53 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
COLING
2010
14 years 5 months ago
Kernel-based Reranking for Named-Entity Extraction
We present novel kernels based on structured and unstructured features for reranking the N-best hypotheses of conditional random fields (CRFs) applied to entity extraction. The fo...
Truc-Vien T. Nguyen, Alessandro Moschitti, Giusepp...
NCA
2011
IEEE
14 years 5 months ago
The effect of weight fault on associative networks
In the past three decades, the properties of associative networks has been extensively investigated. However, most existing results focus on the fault-free networks only. In implem...
Andrew Chi-Sing Leung, Pui-Fai Sum, Kevin Ho
SIAMSC
2010
159views more  SIAMSC 2010»
14 years 5 months ago
The Fast Generalized Gauss Transform
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
Marina Spivak, Shravan K. Veerapaneni, Leslie Gree...
ICCV
2003
IEEE
16 years 16 days ago
Improved Fast Gauss Transform and Efficient Kernel Density Estimation
Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimatio...
Changjiang Yang, Ramani Duraiswami, Nail A. Gumero...
GBRPR
2007
Springer
15 years 2 months ago
Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
Christine Solnon, Jean-Michel Jolion