Sciweavers

7978 search results - page 1305 / 1596
» Representation before computation
Sort
View
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 6 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...
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 6 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,...
BMCBI
2006
141views more  BMCBI 2006»
15 years 6 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
CAD
2006
Springer
15 years 6 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
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
« Prev « First page 1305 / 1596 Last » Next »