Sciweavers

1697 search results - page 223 / 340
» On Bayesian Case Matching
Sort
View
NAR
2006
164views more  NAR 2006»
13 years 9 months ago
FISH - family identification of sequence homologues using structure anchored hidden Markov models
The FISH server is highly accurate in identifying the family membership of domains in a query protein sequence, even in the case of very low sequence identities to known homologue...
Jeanette Tångrot, Lixiao Wang, Bo Kågs...
TCOM
2008
136views more  TCOM 2008»
13 years 9 months ago
Joint source-channel codes based on irregular turbo codes and variable length codes
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. To address this problem, several joint ...
Xavier Jaspar, Luc Vandendorpe
AUTOMATICA
2002
104views more  AUTOMATICA 2002»
13 years 9 months ago
Who needs QP for linear MPC anyway?
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
Basil Kouvaritakis, Mark Cannon, J. Anthony Rossit...
CAL
2002
13 years 9 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally
IPL
2002
118views more  IPL 2002»
13 years 9 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...