Sciweavers

1578 search results - page 34 / 316
» Algorithmic randomness of continuous functions
Sort
View
ISCI
2008
102views more  ISCI 2008»
13 years 11 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
APPROX
2008
Springer
91views Algorithms» more  APPROX 2008»
14 years 29 days ago
Improved Separations between Nondeterministic and Randomized Multiparty Communication
We exhibit an explicit function f : {0,1}n {0,1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n(1) bits of...
Matei David, Toniann Pitassi, Emanuele Viola
ICASSP
2011
IEEE
13 years 2 months ago
On the design of matched orthonormal wavelets with compact support
We develop new algorithms for designing matched wavelets and matched scaling functions using a new parametrization of compactly supported orthonormal wavelets that is developed in...
Mohamed F. Mansour
PVLDB
2010
97views more  PVLDB 2010»
13 years 9 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
CEC
2008
IEEE
14 years 5 months ago
NichingEDA: Utilizing the diversity inside a population of EDAs for continuous optimization
— Since the Estimation of Distribution Algorithms (EDAs) have been introduced, several single model based EDAs and mixture model based EDAs have been developed. Take Gaussian mod...
Weishan Dong, Xin Yao