Sciweavers

7228 search results - page 33 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
BMCBI
2007
160views more  BMCBI 2007»
14 years 9 months ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
70
Voted
CSR
2007
Springer
15 years 3 months ago
Pushing Random Walk Beyond Golden Ratio
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. ...
Ehsan Amiri, Evgeny S. Skvortsov
SOFSEM
2001
Springer
15 years 2 months ago
How Can Computer Science Contribute to Knowledge Discovery?
Knowledge discovery, that is, to analyze a given massive data set and derive or discover some knowledge from it, has been becoming a quite important subject in several fields incl...
Osamu Watanabe
TNN
2011
107views more  TNN 2011»
14 years 4 months ago
Iterative Gaussianization: From ICA to Random Rotations
Abstract—Most signal processing problems involve the challenging task of multidimensional probability density function (PDF) estimation. In this paper, we propose a solution to t...
Valero Laparra, Gustavo Camps-Valls, Jesus Malo
73
Voted
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
15 years 3 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen