Sciweavers

762 search results - page 126 / 153
» Finding Facilities Fast
Sort
View
JMLR
2010
149views more  JMLR 2010»
13 years 4 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
PROCEDIA
2010
138views more  PROCEDIA 2010»
13 years 4 months ago
Using the reconfigurable massively parallel architecture COPACOBANA 5000 for applications in bioinformatics
Currently several computational problems require high processing power to handle huge amounts of data, although underlying core algorithms appear to be rather simple. Especially i...
Lars Wienbrandt, Stefan Baumgart, Jost Bissel, Car...
TEC
2010
171views more  TEC 2010»
13 years 4 months ago
A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...
Shengxiang Yang, Changhe Li
NAR
2011
204views Computer Vision» more  NAR 2011»
13 years 21 days ago
CLIPZ: a database and analysis environment for experimentally determined binding sites of RNA-binding proteins
The stability, localization and translation rate of mRNAs are regulated by a multitude of RNAbinding proteins (RBPs) that find their targets directly or with the help of guide RNA...
Mohsen Khorshid, Christoph Rodak, Mihaela Zavolan
SCFBM
2008
131views more  SCFBM 2008»
13 years 9 months ago
FASH: A web application for nucleotides sequence search
: FASH (Fourier Alignment Sequence Heuristics) is a web application, based on the Fast Fourier Transform, for finding remote homologs within a long nucleic acid sequence. Given a ...
Isana Veksler-Lublinsky, Danny Barash, Chai Avisar...