Sciweavers

1541 search results - page 262 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
FOCS
1989
IEEE
14 years 3 days ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
JBI
2004
171views Bioinformatics» more  JBI 2004»
13 years 9 months ago
Consensus Clustering and Functional Interpretation of Gene Expression Data
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
Paul Kellam, Stephen Swift, Allan Tucker, Veronica...
FOCS
2008
IEEE
13 years 9 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 2 months ago
Takeover times on scale-free topologies
The topological properties of a network directly impact the flow of information through a system. In evolving populations, the topology of inter-individual interactions affects th...
Joshua L. Payne, Margaret J. Eppstein
TALG
2010
158views more  TALG 2010»
13 years 2 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...