Sciweavers

5675 search results - page 238 / 1135
» Exploiting Chaos for Computation
Sort
View
RT
2000
Springer
15 years 10 months ago
Guaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity
Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing ...
Luc Leblanc, Pierre Poulin
CVPR
2004
IEEE
16 years 9 months ago
Gibbs Likelihoods for Bayesian Tracking
Bayesian methods for visual tracking model the likelihood of image measurements conditioned on a tracking hypothesis. Image measurements may, for example, correspond to various fi...
Stefan Roth, Leonid Sigal, Michael J. Black
CLUSTER
2008
IEEE
16 years 1 months ago
A multicore-enabled multirail communication engine
—The current trend in clusters architecture leads toward a massive use of multicore chips. This hardware evolution raises bottleneck issues at the network interface level. The us...
Elisabeth Brunet, François Trahay, Alexandr...
DSN
2007
IEEE
16 years 1 months ago
Multiprocessors May Reduce System Dependability under File-Based Race Condition Attacks
Attacks exploiting race conditions have been considered rare and “low risk”. However, the increasing popularity of multiprocessors has changed this situation: instead of waiti...
Jinpeng Wei, Calton Pu
ICC
2007
IEEE
137views Communications» more  ICC 2007»
16 years 1 months ago
Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
Dejan V. Djonin, Qing Zhao, Vikram Krishnamurthy