Sciweavers

2372 search results - page 135 / 475
» Probabilistic calling context
Sort
View
153
Voted
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
15 years 6 months ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella
WSC
2007
15 years 4 months ago
Analyzing air combat simulation results with dynamic Bayesian networks
In this paper, air combat simulation data is reconstructed into a dynamic Bayesian network. It gives a compact probabilistic model that describes the progress of air combat and al...
Jirka Poropudas, Kai Virtanen
89
Voted
AI
2005
Springer
15 years 2 months ago
Unifying tree decompositions for reasoning in graphical models
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction ...
Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dech...
TR
2010
126views Hardware» more  TR 2010»
14 years 9 months ago
Approximating a Loading-Dependent Cascading Failure Model With a Branching Process
Abstract--We quantify the closeness of the approximation between two high-level probabilistic models of cascading failure. In one model called CASCADE, failing components successiv...
Janghoon Kim, Ian Dobson
ICFCA
2007
Springer
15 years 8 months ago
Some Notes on Pseudo-closed Sets
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
Sebastian Rudolph