1086 search results - page 14 / 218 » Programming by Numbers: A Programming Method for Novices |
104
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
113
Voted
MP
2010
14 years 8 months ago
2010
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
121
Voted
FGR
2006
IEEE
15 years 8 months ago
2006
IEEE
We present a novel tracking algorithm that uses dynamic programming to determine the path of target objects and that is able to track an arbitrary number of different objects. The...
119
Voted
MP
2006
15 years 1 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
79
Voted
APCCM
2007
15 years 3 months ago
2007
Integration of XML data is an increasingly important problem and many methods have recently been developed. In this talk, we examine the related and more challenging task of how t...