Sciweavers

557 search results - page 16 / 112
» A Type-Coercion Problem in Computer Algebra
Sort
View
VLDB
1993
ACM
116views Database» more  VLDB 1993»
13 years 11 months ago
Algebraic Optimization of Computations over Scientific Databases
Although scientific data analysis increasingly requires accessandmanipulation of large quantitiesof data,current databasetechnology fails to meet the needsof scientific processing...
Richard H. Wolniewicz, Goetz Graefe
ICPADS
2006
IEEE
14 years 1 months ago
Scalable Hybrid Designs for Linear Algebra on Reconfigurable Computing Systems
—Recently, high-end reconfigurable computing systems that employ Field-Programmable Gate Arrays (FPGAs) as hardware accelerators for general-purpose processors have been built. T...
Ling Zhuo, Viktor K. Prasanna
ICCV
2009
IEEE
13 years 5 months ago
An algebraic model for fast corner detection
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...
Andrew Willis, Yunfeng Sui
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 6 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
JSC
2007
79views more  JSC 2007»
13 years 7 months ago
Computation of bases of free modules over the Weyl algebras
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
Alban Quadrat, Daniel Robertz