Sciweavers

8669 search results - page 1450 / 1734
» Computing matrix representations
Sort
View
123
Voted
CGF
2008
137views more  CGF 2008»
15 years 3 months ago
Exploiting Visibility Correlation in Direct Illumination
The visibility function in direct illumination describes the binary visibility over a light source, e.g., an environment map. Intuitively, the visibility is often strongly correla...
Petrik Clarberg, Tomas Akenine-Möller
145
Voted
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 3 months ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...
96
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 3 months ago
Optimally Sparse Frames
Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. Howe...
Peter G. Casazza, Andreas Heinecke, Felix Krahmer,...
136
Voted
BMCBI
2006
141views more  BMCBI 2006»
15 years 3 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
135
Voted
CAD
2006
Springer
15 years 3 months ago
Repairing CAD model errors based on the design history
For users of CAD data, few things are as frustrating as receiving unusable, poor quality data. Users often waste time fixing or rebuilding such data from scratch on the basis of p...
Jeongsam Yang, Soonhung Han
« Prev « First page 1450 / 1734 Last » Next »