Sciweavers

19320 search results - page 148 / 3864
» On the complexity of computing determinants
Sort
View
161
Voted
ISMB
2000
15 years 6 months ago
Towards a Systematics for Protein Subcellular Location: Quantitative Description of Protein Localization Patterns and Automated
Determination of the functions of all expressed proteins represents one of the major upcoming challenges in computational molecular biology. Since subcellular location plays a cru...
Robert F. Murphy, Michael V. Boland, Meel Velliste
AFRIGRAPH
2010
ACM
15 years 8 months ago
Progressive RBF interpolation
Interpolation based on Radial Basis Functions (RBF) is very often used for scattered scalar data interpolation in n-dimensional space in general. RBFs are used for surface reconst...
Václav Skala
JSC
2007
84views more  JSC 2007»
15 years 4 months ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 5 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
FOCS
1997
IEEE
15 years 9 months ago
Computable Obstructions to Wait-free Computability
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...
John Havlicek