Sciweavers

8669 search results - page 1451 / 1734
» Computing matrix representations
Sort
View
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 3 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 ...
163
Voted
CG
2007
Springer
15 years 3 months ago
Storylines: Visual exploration and analysis in latent semantic spaces
Tasks in visual analytics differ from typical information retrieval tasks in fundamental ways. A critical part of a visual analytics is to ask the right questions when dealing wit...
Weizhong Zhu, Chaomei Chen
CGF
2007
145views more  CGF 2007»
15 years 3 months ago
Bitmask Soft Shadows
Recently, several real-time soft shadow algorithms have been introduced which all compute a single shadow map and use its texels to obtain a discrete scene representation. The res...
Michael Schwarz, Marc Stamminger
IVC
2008
159views more  IVC 2008»
15 years 3 months ago
Drums, curve descriptors and affine invariant region matching
In this paper we present a new physically motivated curve/region descriptor based on the solution of Helmholtz's equation. The descriptor we propose satisfies the six princip...
Marco Zuliani, Luca Bertelli, Charles S. Kenney, S...
142
Voted
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 3 months ago
Matroid Pathwidth and Code Trellis Complexity
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
Navin Kashyap
« Prev « First page 1451 / 1734 Last » Next »