Sciweavers

580 search results - page 69 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
124
Voted
WSC
2008
15 years 4 months ago
Dynamic entity distribution in parallel discrete event simulation
Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential ...
Michael Slavik, Imad Mahgoub, Ahmed Badi
ICCV
2011
IEEE
14 years 2 months ago
N-best maximal decoders for part models
We describe a method for generating N-best configurations from part-based models, ensuring that they do not overlap according to some user-provided definition of overlap. We ext...
Dennis Park, Deva Ramanan
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 6 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel
136
Voted
TVCG
1998
129views more  TVCG 1998»
15 years 2 months ago
Splatting Errors and Antialiasing
—This paper describes three new results for volume rendering algorithms utilizing splatting. First, an antialiasing extension to the basic splatting algorithm is introduced that ...
Klaus Mueller, Torsten Möller, J. Edward Swan...
WAIM
2010
Springer
15 years 26 days ago
Hotspot District Trajectory Prediction
Trajectory prediction (TP) of moving objects has grown rapidly to be a new exciting paradigm. However, existing prediction algorithms mainly employ kinematical models to approximat...
Hongjun Li, Changjie Tang, Shaojie Qiao, Yue Wang,...