Sciweavers

350 search results - page 32 / 70
» Separation of Partition Inequalities
Sort
View
ICC
2009
IEEE
165views Communications» more  ICC 2009»
14 years 3 months ago
Arbitrarily Tight Upper and Lower Bounds on the Gaussian Q-Function and Related Functions
—We present a new family of tight lower and upper bounds on the Gaussian Q-function Q(x). It is first shown that, for any x, the integrand ϕ(θ; x) of the Craig representation ...
Giuseppe Thadeu Freitas de Abreu
SAC
2006
ACM
14 years 2 months ago
A scalable algorithm for high-quality clustering of web snippets
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
Filippo Geraci, Marco Pellegrini, Paolo Pisati, Fa...
CSB
2004
IEEE
136views Bioinformatics» more  CSB 2004»
14 years 7 days ago
Minimum Entropy Clustering and Applications to Gene Expression Analysis
Clustering is a common methodology for analyzing the gene expression data. In this paper, we present a new clustering algorithm from an information-theoretic point of view. First,...
Haifeng Li, Keshu Zhang, Tao Jiang
CCS
2008
ACM
13 years 10 months ago
A security architecture for transient trust
In extraordinary situations, certain individuals may require access to information for which they are not normally authorized. For example, to facilitate rescue of people trapped ...
Cynthia E. Irvine, Timothy E. Levin, Paul C. Clark...
OSDI
2006
ACM
14 years 8 months ago
Distributed Directory Service in the Farsite File System
We present the design, implementation, and evaluation of a fully distributed directory service for Farsite, a logically centralized file system that is physically implemented on a...
John R. Douceur, Jon Howell