Sciweavers

697 search results - page 24 / 140
» On the Theory of Average Case Complexity
Sort
View
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
14 years 5 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
STACS
1993
Springer
13 years 12 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
ECIS
2004
13 years 9 months ago
Leveraging Theoretical Pluralism in qualitative IS research: The example of IS professionals' identity as a complex phenomenon
As Information Systems (IS) research increasingly acknowledges the importance of non-positivist approaches, the case for a plurality of theories to guide qualitative studies has g...
Jo-Ann Siregar, Michael T. K. Tan
ALT
2008
Springer
14 years 4 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
CIE
2005
Springer
14 years 1 months ago
Formalising Exact Arithmetic in Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
Milad Niqui