Sciweavers

135 search results - page 4 / 27
» Properties of tree convex constraints
Sort
View
SIAMJO
2002
73views more  SIAMJO 2002»
13 years 8 months ago
Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
We study best approximation problems with nonlinear constraints in Hilbert spaces. The strong "conical hull intersection property" (CHIP) and the "basic constraint q...
Chong Li, Xiao-Qing Jin
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 8 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux
JAIR
2008
94views more  JAIR 2008»
13 years 8 months ago
The Ultrametric Constraint and its Application to Phylogenetics
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phyl...
Neil C. A. Moore, Patrick Prosser
BMCBI
2006
112views more  BMCBI 2006»
13 years 8 months ago
Phylophenetic properties of metabolic pathway topologies as revealed by global analysis
Background: As phenotypic features derived from heritable characters, the topologies of metabolic pathways contain both phylogenetic and phenetic components. In the post-genomic e...
Yong Zhang, Shaojuan Li, Geir Skogerbø, Zhi...
ICML
2008
IEEE
14 years 9 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr