Sciweavers

914 search results - page 77 / 183
» Branch and Bound on the Network Model
Sort
View
APBC
2008
231views Bioinformatics» more  APBC 2008»
14 years 11 months ago
Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...
Francis Y. L. Chin, Henry C. M. Leung, Man-Hung Si...
INFOCOM
2008
IEEE
15 years 4 months ago
The Inframetric Model for the Internet
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Vien...
NIPS
2003
14 years 11 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan
ICARCV
2008
IEEE
146views Robotics» more  ICARCV 2008»
15 years 4 months ago
Stabilization of networked multi-input systems with channel resource allocation
—In this paper, we study the problem of stabilizing a linear time-invariant discrete-time system with information constraints in the input channels. The information constraint in...
Guoxiang Gu, Li Qiu
VISUALIZATION
1995
IEEE
15 years 1 months ago
Automatic Generation of Triangular Irregular Networks Using Greedy Cuts
We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greed...
Cláudio T. Silva, Joseph S. B. Mitchell, Ar...