Sciweavers

19320 search results - page 438 / 3864
» On the complexity of computing determinants
Sort
View
BMCBI
2008
111views more  BMCBI 2008»
15 years 7 months ago
MLIP: using multiple processors to compute the posterior probability of linkage
Background: Localization of complex traits by genetic linkage analysis may involve exploration of a vast multidimensional parameter space. The posterior probability of linkage (PP...
Manika Govil, Alberto Maria Segre, Veronica J. Vie...
STOC
2007
ACM
108views Algorithms» more  STOC 2007»
16 years 8 months ago
Combinatorial complexity in O-minimal geometry
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
Saugata Basu
FCT
2007
Springer
16 years 1 months ago
The Quantum Query Complexity of Algebraic Properties
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
Sebastian Dörn, Thomas Thierauf
COMPLEX
2009
Springer
16 years 9 days ago
Complex Multi-modal Multi-level Influence Networks - Affordable Housing Case Study -
Most influence networks are depicted as nodes and links operating in the manner of a feed-forward neural network where both nodes and links appear to be homogenous in their nature....
Patrick Beautement, Christine Brönner
SACRYPT
2001
Springer
130views Cryptology» more  SACRYPT 2001»
16 years 3 days ago
On the Complexity of Matsui's Attack
Linear cryptanalysis remains the most powerful attack against DES at this time. Given 243 known plaintext-ciphertext pairs, Matsui expected a complexity of less than 243 DES evalua...
Pascal Junod