Sciweavers

2969 search results - page 59 / 594
» A space efficient algorithm for group structure computation
Sort
View
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 7 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
PODC
2010
ACM
15 years 5 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
CVPR
2009
IEEE
16 years 7 months ago
Early Spatiotemporal Grouping with a Distributed Oriented Energy Representation
Spatiotemporal data is associated with vast amounts of raw samples. Given the limited computational resources typically available, an initial organization of this data supporting ...
Konstantinos G. Derpanis, Richard P. Wildes
BMCBI
2005
151views more  BMCBI 2005»
15 years 3 months ago
stam - a Bioconductor compliant R package for structured analysis of microarray data
Background: Genome wide microarray studies have the potential to unveil novel disease entities. Clinically homogeneous groups of patients can have diverse gene expression profiles...
Claudio Lottaz, Rainer Spang
SCN
2008
Springer
136views Communications» more  SCN 2008»
15 years 3 months ago
An efficient data structure for network anomaly detection
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...
Jieyan Fan, Dapeng Wu, Kejie Lu, Antonio Nucci