Sciweavers

3604 search results - page 585 / 721
» All Common Subsequences
Sort
View
PODC
2009
ACM
16 years 4 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
HPCA
2009
IEEE
16 years 4 months ago
Accurate microarchitecture-level fault modeling for studying hardware faults
Decreasing hardware reliability is expected to impede the exploitation of increasing integration projected by Moore's Law. There is much ongoing research on efficient fault t...
Man-Lap Li, Pradeep Ramachandran, Ulya R. Karpuzcu...
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
16 years 4 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
KDD
2009
ACM
249views Data Mining» more  KDD 2009»
16 years 4 months ago
Drosophila gene expression pattern annotation using sparse features and term-term interactions
The Drosophila gene expression pattern images document the spatial and temporal dynamics of gene expression and they are valuable tools for explicating the gene functions, interac...
Shuiwang Ji, Lei Yuan, Ying-Xin Li, Zhi-Hua Zhou, ...
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 4 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer