519 search results - page 53 / 104 » A New Approach to Strongly Polynomial Linear Programming |
118
click to vote
LCTRTS
2004
Springer
15 years 9 months ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
156
click to vote
PLDI
2006
ACM
15 years 10 months ago
2006
ACM
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
159
click to vote
RECOMB
2002
Springer
16 years 4 months ago
2002
Springer
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
143
click to vote
ICVS
2003
Springer
15 years 9 months ago
2003
Springer
We propose a method to construct computer vision systems using a workbench composed of a multi-faceted toolbox and a general purpose kernel. The toolbox is composed of an open set ...
134
Voted
DBPL
1999
Springer
15 years 8 months ago
1999
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...