Sciweavers

526 search results - page 10 / 106
» Improved Decomposition of STGs
Sort
View
RT
1999
Springer
15 years 4 months ago
Interactive Rendering with Arbitrary BRDFs using Separable Approximations
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...
Jan Kautz, Michael D. McCool
ICMCS
2009
IEEE
130views Multimedia» more  ICMCS 2009»
14 years 9 months ago
On improving the collision property of robust hashing based on projections
In this paper, we study the collision property of one of the robust hash functions proposed in [1]. This method was originally proposed for robust hash generation from blocks of i...
Regunathan Radhakrishnan, Wenyu Jiang, Claus Bauer
DAC
2003
ACM
16 years 21 days ago
A new enhanced constructive decomposition and mapping algorithm
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
Alan Mishchenko, Xinning Wang, Timothy Kam
VLSID
2004
IEEE
108views VLSI» more  VLSID 2004»
16 years 3 days ago
Boolean Decomposition Using Two-literal Divisors
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
Nilesh Modi, Jordi Cortadella
AAAI
2011
13 years 11 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter