Sciweavers

14704 search results - page 277 / 2941
» computing 2007
Sort
View
139
Voted
AAAI
2007
15 years 6 months ago
A Mathematical Programming Formulation for Sparse Collaborative Computer Aided Diagnosis
A mathematical programming formulation is proposed to eliminate irrelevant and redundant features for collaborative computer aided diagnosis which requires to detect multiple clin...
Jinbo Bi, Tao Xiong
CORR
2007
Springer
115views Education» more  CORR 2007»
15 years 3 months ago
FPRAS for computing a lower bound for weighted matching polynomial of graphs
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
Shmuel Friedland
147
Voted
EOR
2007
99views more  EOR 2007»
15 years 3 months ago
Computing the asymptotic worst-case of bin packing lower bounds
This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptoti...
Teodor Gabriel Crainic, Guido Perboli, Miriam Pezz...
IGPL
2007
107views more  IGPL 2007»
15 years 3 months ago
Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
Marcelo Finger, Dov M. Gabbay
IJBC
2007
86views more  IJBC 2007»
15 years 3 months ago
Optimization and the Miranda Approach in Detecting Horseshoe-Type Chaos by Computer
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...
Balázs Bánhelyi, Tibor Csendes, Barn...