Sciweavers

2680 search results - page 364 / 536
» The topology of the independence complex
Sort
View
IPPS
1997
IEEE
15 years 10 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 7 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
15 years 7 months ago
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
BMCBI
2008
143views more  BMCBI 2008»
15 years 6 months ago
catmap: Case-control And TDT Meta-Analysis Package
Background: Risk for complex disease is thought to be controlled by multiple genetic risk factors, each with small individual effects. Meta-analyses of several independent studies...
Kristin K. Nicodemus
BMCBI
2006
174views more  BMCBI 2006»
15 years 6 months ago
CARAT: A novel method for allelic detection of DNA copy number changes using high density oligonucleotide arrays
Background: DNA copy number alterations are one of the main characteristics of the cancer cell karyotype and can contribute to the complex phenotype of these cells. These alterati...
Jing Huang, Wen Wei, Joyce Chen, Jane Zhang, Guoyi...