1723 search results - page 185 / 345 » Cycling in linear programming problems |
CDB
1997
Springer
15 years 2 months ago
1997
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databa...
103
click to vote
KDD
2006
ACM
15 years 10 months ago
2006
ACM
This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging larg...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...