Sciweavers

451 search results - page 79 / 91
» On Parameterized Exponential Time Complexity
Sort
View
SI3D
2005
ACM
14 years 3 months ago
Texture sprites: texture elements splatted on surfaces
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...
Sylvain Lefebvre, Samuel Hornus, Fabrice Neyret
INFOCOM
2003
IEEE
14 years 3 months ago
Chaotic Maps as Parsimonious Bit Error Models of Wireless Channels
Abstract—The error patterns of a wireless digital communication channel can be described by looking at consecutively correct or erroneous bits (runs and bursts) and at the distri...
Andreas Köpke, Andreas Willig, Holger Karl
PAMI
2002
150views more  PAMI 2002»
13 years 9 months ago
Object Tracking with Bayesian Estimation of Dynamic Layer Representations
Decomposing video frames into coherent two-dimensional motion layers is a powerful method for representing videos. Such a representation provides an intermediate description that e...
Hai Tao, Harpreet S. Sawhney, Rakesh Kumar
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 4 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
KR
2010
Springer
14 years 2 months ago
Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus