Sciweavers

2899 search results - page 355 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
ICMCS
2008
IEEE
175views Multimedia» more  ICMCS 2008»
16 years 29 days ago
Fast mode decision for adaptive prediction error coding
In [1], Adaptive Prediction Error Coding (APEC) in spatial and frequency domain is proposed and significantly improves the coding efficiency of video coders. However, this approac...
Cixun Zhang, Kemal Ugur, Moncef Gabbouj
AAECC
2007
Springer
109views Algorithms» more  AAECC 2007»
16 years 21 days ago
The Tangent FFT
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
Daniel J. Bernstein
UAI
2003
15 years 7 months ago
An Empirical Study of w-Cutset Sampling for Bayesian Networks
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
Bozhena Bidyuk, Rina Dechter
CGF
2004
113views more  CGF 2004»
15 years 6 months ago
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
Jirí Bittner, Michael Wimmer, Harald Piring...
ISAAC
2005
Springer
98views Algorithms» more  ISAAC 2005»
16 years 16 hour ago
Casting an Object with a Core
This paper addresses geometric problems that concern manufacturing an object using a cast with a core. In casting, molten material is poured into the cavity of the cast and allowe...
Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Y...