Sciweavers

306 search results - page 24 / 62
» Underspecified computation of normal forms
Sort
View
FOCM
2010
91views more  FOCM 2010»
13 years 6 months ago
On the Ranks and Border Ranks of Symmetric Tensors
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We...
J. M. Landsberg, Zach Teitler
BMCBI
2006
131views more  BMCBI 2006»
13 years 7 months ago
The statistics of identifying differentially expressed genes in Expresso and TM4: a comparison
Background: Analysis of DNA microarray data takes as input spot intensity measurements from scanner software and returns differential expression of genes between two conditions, t...
Allan A. Sioson, Shrinivasrao P. Mane, Pinghua Li,...
DAC
2009
ACM
14 years 8 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
SI3D
2010
ACM
14 years 27 days ago
LEAN mapping
We introduce Linear Efficient Antialiased Normal (LEAN) Mapping, a method for real-time filtering of specular highlights in bump and normal maps. The method evaluates bumps as p...
Marc Olano, Dan Baker
DIGRA
2005
Springer
14 years 1 months ago
End of story? Quest, narrative and enactment in computer games
Espen Aarseth recently claimed that all games referred to as ’narrative games’ could better be described as ’quest games’. The writer of this paper suggests that Max Payne...
Anders Sundnes Løvlie