Sciweavers

20197 search results - page 368 / 4040
» Comparing Computational Power
Sort
View
COCO
1998
Springer
109views Algorithms» more  COCO 1998»
15 years 11 months ago
Complexity Limitations on Quantum Computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
Lance Fortnow, John D. Rogers
STOC
1996
ACM
197views Algorithms» more  STOC 1996»
15 years 11 months ago
Computing Betti Numbers via Combinatorial Laplacians
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
Joel Friedman
EUROSYS
2008
ACM
16 years 3 months ago
GreenFS: making enterprise computers greener by protecting them better
Hard disks contain data—frequently an irreplaceable asset of high monetary and non-monetary value. At the same time, hard disks are mechanical devices that consume power, are no...
Nikolai Joukov, Josef Sipek
BMCBI
2006
117views more  BMCBI 2006»
15 years 6 months ago
The Cluster Variation Method for Efficient Linkage Analysis on Extended Pedigrees
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
Cornelis A. Albers, Martijn A. R. Leisink, Hilbert...
177
Voted
ICPR
2008
IEEE
16 years 1 months ago
A network intrusion detection method using independent component analysis
An intrusion detection system (IDS) detects illegal manipulations of computer systems. In intrusion detection systems, feature reduction, including feature extraction and feature ...
Dayu Yang, Hairong Qi