Sciweavers

1391 search results - page 101 / 279
» Complexity Limitations on Quantum Computation
Sort
View
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 7 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
ICPR
2010
IEEE
15 years 10 months ago
Boolean Combination of Classifiers in the ROC Space
Using Boolean AND and OR functions to combine the responses of multiple one- or two-class classifiers in the ROC space may significantly improve performance of a detection system o...
Wael Khreich, Eric Granger, Ali Miri, R. Sabourin
CORR
2002
Springer
135views Education» more  CORR 2002»
15 years 6 months ago
Minimal-Change Integrity Maintenance Using Tuple Deletions
We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. We assume that integrity-restoration actions are li...
Jan Chomicki, Jerzy Marcinkowski
MST
1998
76views more  MST 1998»
15 years 5 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
GI
2009
Springer
15 years 4 months ago
Coarse graining of an individual-based plant model
: The evolution and structuring of plant communities is governed by local plant-to-plant interaction. It has been shown that the individual variability of the organisms and the spa...
Johannes Hoefener, Lars Rudolf, Uta Berger, Thilo ...