Sciweavers

3757 search results - page 92 / 752
» The overlap number of a graph
Sort
View
BMCBI
2010
214views more  BMCBI 2010»
15 years 6 months ago
AutoSOME: a clustering method for identifying gene expression modules without prior knowledge of cluster number
Background: Clustering the information content of large high-dimensional gene expression datasets has widespread application in "omics" biology. Unfortunately, the under...
Aaron M. Newman, James B. Cooper
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
SPAA
1997
ACM
15 years 10 months ago
Fine-Grain Multithreading with the EM-X Multiprocessor
- Multithreading aims to tolerate latency by overlapping communication with computation. This report explicates the multithreading capabilities of the EM-X distributed-memory multi...
Andrew Sohn, Yuetsu Kodama, Jui Ku, Mitsuhisa Sato...
COMBINATORICS
2006
123views more  COMBINATORICS 2006»
15 years 6 months ago
The Non-Crossing Graph
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
Nathan Linial, Michael E. Saks, David Statter
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 6 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...