Sciweavers

1523 search results - page 69 / 305
» The Computational Complexity of Linear Optics
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 9 months ago
Approximability and parameterized complexity of minmax values
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen,...
IPPS
2008
IEEE
14 years 3 months ago
Build to order linear algebra kernels
—The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex ...
Jeremy G. Siek, Ian Karlin, Elizabeth R. Jessup
WABI
2009
Springer
130views Bioinformatics» more  WABI 2009»
14 years 3 months ago
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...
Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
COMPGEOM
2006
ACM
14 years 2 months ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
IPPS
2009
IEEE
14 years 3 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert