Sciweavers

602 search results - page 41 / 121
» A New Approximation Method of the Quadratic Discriminant Fun...
Sort
View
AAAI
2010
15 years 3 months ago
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
Emma Rollon, Rina Dechter
ARITH
2003
IEEE
15 years 6 months ago
Scaling an RNS Number Using the Core Function
This paper introduces a method for extracting the core of a Residue Number System (RNS) number within the RNS, this affording a new method for scaling RNS numbers. Suppose an RNS ...
Neil Burgess
COLING
2008
15 years 3 months ago
Sentence Compression Beyond Word Deletion
In this paper we generalise the sentence compression task. Rather than simply shorten a sentence by deleting words or constituents, as in previous work, we rewrite it using additi...
Trevor Cohn, Mirella Lapata
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 1 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
SIAMJO
2002
142views more  SIAMJO 2002»
15 years 1 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...