Sciweavers

249 search results - page 21 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
CGF
1999
81views more  CGF 1999»
13 years 8 months ago
Multi-layered impostors for accelerated rendering
This paper describes the successful combination of pre-generated and dynamically updated image-based representations to accelerate the visualization of complex virtual environment...
Xavier Décoret, François X. Sillion,...
ICASSP
2011
IEEE
13 years 22 days ago
A fast transform for acoustic imaging with separable arrays
Acoustic imaging is a computationally intensive and ill-conditioned inverse problem, which involves estimating high resolution source distributions with large microphone arrays. I...
Flavio P. Ribeiro, Vitor H. Nascimento
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 6 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
DATE
2007
IEEE
100views Hardware» more  DATE 2007»
13 years 9 months ago
A new pipelined implementation for minimum norm sorting used in square root algorithm for MIMO-VBLAST systems
Multiple Input - Multiple Output (MIMO) wireless technology involves highly complex vectors and matrix computations which are directly related to increased power and area consumpt...
Zahid Khan, Tughrul Arslan, John S. Thompson, Ahme...
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
14 years 2 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...