207 search results - page 10 / 42 » Smoothed analysis of integer programming |
146
Voted
BIRTHDAY
2009
Springer
16 years 18 days ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
179
Voted
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
160
click to vote
ECCV
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. We propose a novel method for action detection based on a new action descriptor called a shape flow that represents both the shape and movement of an object in a holistic...
158
Voted
SIAMJO
2008
15 years 5 months ago
2008
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
148
Voted
ISSRE
2003
IEEE
15 years 11 months ago
2003
IEEE
Partition testing is a well-known software testing technique. This paper shows that partition testing strategies are relatively ineffective in detecting faults related to small sh...