Sciweavers

2430 search results - page 204 / 486
» Computing Tutte Polynomials
Sort
View
SCA
2007
15 years 7 months ago
Legendre fluids: a unified framework for analytic reduced space modeling and rendering of participating media
In this paper, we present a unified framework for reduced space modeling and rendering of dynamic and nonhomogenous participating media, like snow, smoke, dust and fog. The key id...
Mohit Gupta, Srinivasa G. Narasimhan
ICASSP
2010
IEEE
15 years 4 months ago
Implementing LNS using filtering units of GPUs
Current GPUs offer specialized graphics hardware in addition to generic floating-point processing units. We propose a method which reuses specialized texture filtering units to ...
Mark G. Arnold, Sylvain Collange, David Defour
ACTA
2006
154views more  ACTA 2006»
15 years 4 months ago
Solving HPP and SAT by P Systems with Active Membranes and Separation Rules
The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obta...
Linqiang Pan, Artiom Alhazov
ITA
2008
147views Communications» more  ITA 2008»
15 years 4 months ago
A morphic approach to combinatorial games: the Tribonacci case
We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing positions can be derived from the Tribonacci word instead of the Fibonacci word...
Éric Duchêne, Michel Rigo
ECCC
2007
91views more  ECCC 2007»
15 years 4 months ago
Which Languages Have 4-Round Zero-Knowledge Proofs?
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯L ∈ MA. Assuming the polynomial hierarch...
Jonathan Katz