Sciweavers

85 search results - page 17 / 17
» The Expected Size of the Rule k Dominating Set
Sort
View
ICALP
2009
Springer
14 years 5 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
BMCBI
2011
12 years 8 months ago
To aggregate or not to aggregate high-dimensional classifiers
Background: High-throughput functional genomics technologies generate large amount of data with hundreds or thousands of measurements per sample. The number of sample is usually m...
Cheng-Jian Xu, Huub C. J. Hoefsloot, Age K. Smilde
BMCBI
2008
195views more  BMCBI 2008»
13 years 5 months ago
Goldsurfer2 (Gs2): A comprehensive tool for the analysis and visualization of genome wide association studies
Background: Genome wide association (GWA) studies are now being widely undertaken aiming to find the link between genetic variations and common diseases. Ideally, a well-powered G...
Fredrik Pettersson, Andrew P. Morris, Michael R. B...
VLSISP
2011
358views Database» more  VLSISP 2011»
12 years 12 months ago
Accelerating Machine-Learning Algorithms on FPGAs using Pattern-Based Decomposition
Machine-learning algorithms are employed in a wide variety of applications to extract useful information from data sets, and many are known to suffer from superlinear increases in ...
Karthik Nagarajan, Brian Holland, Alan D. George, ...
CCS
2001
ACM
13 years 8 months ago
Efficient State Updates for Key Management
Encryption is widely used to enforce usage rules for digital content. In many scenarios content is encrypted using a group key which is known to a group of users that are allowed ...
Benny Pinkas