Sciweavers

67 search results - page 10 / 14
» Constructing Strictly Positive Families
Sort
View
CCCG
2009
13 years 9 months ago
On Directed Graphs with an Upward Straight-line
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
Carla Binucci, Emilio Di Giacomo, Walter Didimo, A...
TIT
2008
83views more  TIT 2008»
13 years 7 months ago
Hard Problems of Algebraic Geometry Codes
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
Qi Cheng
BMCBI
2007
117views more  BMCBI 2007»
13 years 8 months ago
Supervised multivariate analysis of sequence groups to identify specificity determining residues
Background: Proteins that evolve from a common ancestor can change functionality over time, and it is important to be able identify residues that cause this change. In this paper ...
Iain M. Wallace, Desmond G. Higgins
MCSS
2007
Springer
13 years 7 months ago
Lyapunov functions for time-varying systems satisfying generalized conditions of Matrosov theorem
The classical Matrosov theorem concludes uniform asymptotic stability of time varying systems via a weak Lyapunov function (positive definite, decrescent, with negative semidefi...
Frédéric Mazenc, Dragan Nesic
CG
2006
Springer
13 years 8 months ago
Interactive mesh deformation using equality-constrained least squares
Mesh deformation techniques that preserve the differential properties have been intensively studied. In this paper, we propose an equality-constrained least squares approach for s...
H. Masuda, Y. Yoshioka, Y. Furukawa