Sciweavers

545 search results - page 23 / 109
» Estimating the Probability of Approximate Matches
Sort
View
ICASSP
2011
IEEE
14 years 4 months ago
Gaussian mixture modeling for source localization
Exploiting prior knowledge, we use Bayesian estimation to localize a source heard by a fixed sensor network. The method has two main aspects: Firstly, the probability density fun...
John T. Flåm, Joakim Jalden, Saikat Chatterj...
94
Voted
ANSS
2005
IEEE
15 years 6 months ago
Approximation Techniques for the Analysis of Large Traffic-Groomed Tandem Optical Networks
We consider a traffic-groomed optical network consisting of N nodes arranged in tandem. This optical network is modeled by a tandem queueing network of multi-rate loss queues with...
Alicia Nicki Washington, Chih-Chieh Hsu, Harry G. ...
210
Voted
ASUNAM
2011
IEEE
14 years 18 days ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
106
Voted
CIAC
2000
Springer
121views Algorithms» more  CIAC 2000»
15 years 4 months ago
An Efficient Algorithm for the Approximate Median Selection Problem
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
Sebastiano Battiato, Domenico Cantone, Dario Catal...
143
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Entropy estimation using the principle of maximum entropy
In this paper, we present a novel entropy estimator for a given set of samples drawn from an unknown probability density function (PDF). Counter to other entropy estimators, the e...
Behrouz Behmardi, Raviv Raich, Alfred O. Hero