Sciweavers

6274 search results - page 704 / 1255
» From query complexity to computational complexity
Sort
View
SMI
2003
IEEE
143views Image Analysis» more  SMI 2003»
16 years 22 days ago
Rough Surface Modeling Using Surface Growth
In this paper, we present a novel modeling method for synthesizing rough surfaces using discrete surface growth models. We employ a two-pass method. Initial point cluster data is ...
Yootai Kim, Raghu Machiraju, David Thompson
COCO
2003
Springer
145views Algorithms» more  COCO 2003»
16 years 20 days ago
Hardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
Emanuele Viola
ISPAN
1999
IEEE
15 years 11 months ago
Performance and Granularity Control in the SPaDES Parallel Simulation System
Parallel simulationhas the potentialto accelerate the execution of simulation applications. However, developing a parallel discrete-event simulation from scratch requires an in-de...
Yong Meng Teo, Seng Chuan Tay
RECOMB
2000
Springer
15 years 11 months ago
Using Bayesian networks to analyze expression data
DNA hybridization arrays simultaneously measure the expression level for thousands of genes. These measurements provide a "snapshot" of transcription levels within the c...
Nir Friedman, Michal Linial, Iftach Nachman, Dana ...
BMCBI
2008
119views more  BMCBI 2008»
15 years 7 months ago
On deducing causality in metabolic networks
Background: Metabolic networks present a complex interconnected structure, whose understanding is in general a non-trivial task. Several formal approaches have been developed to s...
Chiara Bodei, Andrea Bracciali, Davide Chiarugi