194 search results - page 21 / 39 » Computing Roundness is Easy if the Set is Almost Round |
DAGSTUHL
2008
13 years 9 months ago
2008
Existing selfverifying solvers for dense linear (interval-)systems in C-XSC provide high accuracy, but are rather slow. A new set of solvers is presented, which are a lot faster th...
DISOPT
2007
13 years 7 months ago
2007
We present a scheme for generating new valid inequalities for mixed integer programs by taking pairwise combinations of existing valid inequalities. Our scheme is related to mixed...
ATMOS
2010
13 years 6 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
We present in this paper a supervised approach for automatic detection of micro-calcifications. The system is based on learning the different morphology of the micro-calcification...