Sciweavers

1672 search results - page 291 / 335
» Optimizing Monitoring Queries over Distributed Data
Sort
View
HPCA
1999
IEEE
15 years 2 months ago
Dynamically Exploiting Narrow Width Operands to Improve Processor Power and Performance
In general-purpose microprocessors, recent trends have pushed towards 64-bit word widths, primarily to accommodate the large addressing needs of some programs. Many integer proble...
David Brooks, Margaret Martonosi
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ISBI
2009
IEEE
15 years 5 months ago
Improving M/EEG Source Localization with an Inter-Condition Sparse Prior
The inverse problem with distributed dipoles models in M/EEG is strongly ill-posed requiring to set priors on the solution. Most common priors are based on a convenient ℓ2 norm....
Alexandre Gramfort, Matthieu Kowalski
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
15 years 2 months ago
Beyond heuristics: learning to classify vulnerabilities and predict exploits
The security demands on modern system administration are enormous and getting worse. Chief among these demands, administrators must monitor the continual ongoing disclosure of sof...
Mehran Bozorgi, Lawrence K. Saul, Stefan Savage, G...
WWW
2007
ACM
15 years 10 months ago
The complex dynamics of collaborative tagging
The debate within the Web community over the optimal means by which to organize information often pits formalized classifications against distributed collaborative tagging systems...
Harry Halpin, Valentin Robu, Hana Shepherd