Sciweavers

2 search results - page 1 / 1
» New Mini-Bucket Partitioning Heuristics for Bounding the Pro...
Sort
View
AAAI
2010
13 years 6 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
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 6 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella