Sciweavers

2430 search results - page 428 / 486
» Computing Tutte Polynomials
Sort
View
FSTTCS
2008
Springer
15 years 3 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
SI3D
2010
ACM
15 years 2 months ago
Efficient irradiance normal mapping
Irradiance normal mapping is a method to combine two popular techniques, light mapping and normal mapping, and is used in games such as Half-Life 2 or Halo 3. This combination all...
Ralf Habel, Michael Wimmer
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 2 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
IJISEC
2007
61views more  IJISEC 2007»
15 years 1 months ago
Identity-based key agreement protocols from pairings
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, the security of this ty...
Liqun Chen, Zhaohui Cheng, Nigel P. Smart
TPDS
2008
196views more  TPDS 2008»
15 years 1 months ago
End-to-End Energy Management in Networked Real-Time Embedded Systems
Recent technological advances have opened up a wide range of distributed real-time applications involving battery-driven embedded devices with local processing and wireless communi...
G. Sudha Anil Kumar, Govindarasu Manimaran, Zhengd...