2040 search results - page 71 / 408 » Approximate Expectation Maximization |
135
Voted
MOR
2006
14 years 11 months ago
2006
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
FSS
2010
14 years 10 months ago
2010
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
118
click to vote
CIDM
2007
IEEE
15 years 3 months ago
2007
IEEE
Recently the academic communities have paid more attention to the queries and mining on uncertain data. In the tasks such as clustering or nearest-neighbor queries, expected distan...
IPL
2000
14 years 11 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
IPSN
2003
Springer
15 years 4 months ago
2003
Springer
This paper presents a sensor management scheme based on maximizing the expected R´enyi Information Divergence at each sample, applied to the problem of tracking multiple targets. ...