327 search results - page 28 / 66 » A fully dynamic algorithm for planar |
CSB
2002
IEEE
15 years 4 months ago
2002
IEEE
There is a pressing need to align growing set of expressed sequence tags (ESTs) to newly sequenced human genome. The problem is, however, complicated by the exon/intron structure ...
DCC
2005
IEEE
15 years 11 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
107
click to vote
UAI
2004
15 years 1 months ago
2004
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
MICCAI
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. A fully automated method for quantitative analysis of dynamic contrast-enhanced MRI data acquired with low and high field scanners, using spin echo and gradient echo seq...
113
click to vote
COMGEO
2012
ACM
13 years 7 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...