Sciweavers

2040 search results - page 373 / 408
» Approximate Expectation Maximization
Sort
View
BMCBI
2007
164views more  BMCBI 2007»
15 years 23 days ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason
121
Voted
BMCBI
2007
105views more  BMCBI 2007»
15 years 23 days ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
98
Voted
JCB
2006
107views more  JCB 2006»
15 years 21 days ago
Maximum Likelihood Molecular Clock Comb: Analytic Solutions
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...
Benny Chor, Amit Khetan, Sagi Snir
135
Voted
JSAC
2008
125views more  JSAC 2008»
15 years 21 days ago
Optimal Competitive Algorithms for Opportunistic Spectrum Access
We consider opportunistic spectrum access (OSA) strategies for a transmitter in a multichannel wireless system, where a channel may or may not be available and the transmitter must...
Nicholas B. Chang, Mingyan Liu
TIP
2008
287views more  TIP 2008»
15 years 19 days ago
3-D Object Recognition Using 2-D Views
We consider the problem of recognizing 3-D objects from 2-D images using geometric models and assuming different viewing angles and positions. Our goal is to recognize and localize...
Wenjing Li, George Bebis, Nikolaos G. Bourbakis