UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Efficient algorithms to discover alterations with complementary functional association in cancer

PLoS computational biology, 2019-05, Vol.15 (5), p.e1006802-e1006802

2019

Volltextzugriff (PDF)

A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant

Operations research, 2013-01, Vol.61 (1), p.184-198

Hochbaum, Dorit S.

2013

Volltextzugriff (PDF)

Complexity and algorithms for nonlinear optimization problems

Annals of operations research, 2007-09, Vol.153 (1), p.257-296

Hochbaum, Dorit S

2007

Volltextzugriff (PDF)

Network-based approaches elucidate differences within APOBEC and clock-like signatures in breast cancer

Genome medicine, 2020-05, Vol.12 (1), p.52-12, Article 52

2020

Volltextzugriff (PDF)

Algorithms and Complexities of Matching Variants in Covariate Balancing

Operations research, 2023-09, Vol.71 (5), p.1800-1814

2023

Volltextzugriff (PDF)

Network flow methods for the minimum covariate imbalance problem

European journal of operational research, 2022-08, Vol.300 (3), p.827-836

2022

Volltextzugriff (PDF)

A unified approach for a 1D generalized total variation problem

Mathematical programming, 2022-07, Vol.194 (1-2), p.415-442

2022

Volltextzugriff (PDF)

The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

Operations research, 2008-07, Vol.56 (4), p.992-1009

Hochbaum, Dorit S

2008

Volltextzugriff (PDF)

Applications and efficient algorithms for integer programming problems on monotone constraints

Networks, 2021-01, Vol.77 (1), p.21-49

Hochbaum, Dorit S.

2021

Volltextzugriff (PDF)

Complexity and approximations for submodular minimization problems on two variables per inequality constraints

Discrete Applied Mathematics, 2018-12, Vol.250, p.252-261

Hochbaum, Dorit S.

2018

Volltextzugriff (PDF)

Identifying Drug Sensitivity Subnetworks with NETPHIX

iScience, 2020-10, Vol.23 (10), p.101619-101619, Article 101619

2020

Volltextzugriff (PDF)

Algorithms and complexity of range clustering

Networks, 2019-03, Vol.73 (2), p.170-186

Hochbaum, Dorit S.

2019

Volltextzugriff (PDF)

A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem

Computers & industrial engineering, 2016-05, Vol.95, p.64-71

Hochbaum, Dorit S.

2016

Volltextzugriff (PDF)

The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem

Operations research, 2019-09, Vol.67 (5), p.1345-1361

2019

Volltextzugriff (PDF)

Complexity, algorithms and applications of the integer network flow with fractional supplies problem

Operations research letters, 2021-07, Vol.49 (4), p.559-564

2021

Volltextzugriff (PDF)

Isolation branching: a branch and bound algorithm for the k-terminal cut problem

Journal of combinatorial optimization, 2022-10, Vol.44 (3), p.1659-1679

2022

Volltextzugriff (PDF)

Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing

Operations research, 2018-11, Vol.66 (6), p.1571-1585

2018

Volltextzugriff (PDF)

Methodologies and Algorithms for Group-Rankings Decision

Management science, 2006-09, Vol.52 (9), p.1394-1408

2006

Volltextzugriff (PDF)

A fully polynomial time approximation scheme for the Replenishment Storage problem

Operations research letters, 2020-11, Vol.48 (6), p.835-839

2020

Volltextzugriff (PDF)

Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut

IEEE transactions on pattern analysis and machine intelligence, 2010-05, Vol.32 (5), p.889-898

Hochbaum, D.S.

2010

Volltextzugriff (PDF)

A Graph-Theoretic Approach for Spatial Filtering and Its Impact on Mixed-Type Spatial Pattern Recognition in Wafer Bin Maps

IEEE transactions on semiconductor manufacturing, 2021-05, Vol.34 (2), p.194-206

2021

Volltextzugriff (PDF)

Complexity of some inverse shortest path lengths problems

Networks, 2010-08, Vol.56 (1), p.20-29

2010

Volltextzugriff (PDF)

Solving the Convex Cost Integer Dual Network Flow Problem

Management science, 2003-07, Vol.49 (7), p.950-964

2003

Volltextzugriff (PDF)

A Better Decision Tree: The Max-Cut Decision Tree with Modified PCA Improves Accuracy and Running Time

SN computer science, 2022-07, Vol.3 (4), p.313, Article 313

2022

Volltextzugriff (PDF)

HNCcorr: combinatorial optimization for neuron identification

Annals of operations research, 2020-06, Vol.289 (1), p.5-32

2020

Volltextzugriff (PDF)

1 – 25 von 210

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(189)
Mit Volltextzugriff
(203)

Publikationsform

2 weitere anzeigen...

Weniger anzeigen...

Sprache

Englisch
(210)
Japanisch
(24)

Erscheinungsjahr

n.n

Thema

Science & Technology
(132)
Technology
(106)
Exact Sciences And Technology
(90)
Applied Sciences
(85)
Operations Research & Management Science
(68)
Algorithms
(63)
Computer Science
(60)
Operational Research. Management Science
(52)
Operational Research And Scientific Management
(51)
Mathematics
(49)
Computer Science; Control Theory; Systems
(47)
Physical Sciences
(46)
Theoretical Computing
(42)
Algorithmics. Computability. Computer Arithmetics
(41)
Mathematics, Applied
(41)
Studies
(34)
Optimization
(31)
Social Sciences
(29)
Business & Economics
(28)
Operations Research
(28)

15 weitere anzeigen...

Weniger anzeigen...

Zeitschrift / Serie

5 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 30 Tagen
(1)
... seit 90 Tagen
(2)

Menü

Weitere Dienste

Einstellungen

Efficient algorithms to discover alterations with complementary functional association in cancer

A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant

Complexity and algorithms for nonlinear optimization problems

Network-based approaches elucidate differences within APOBEC and clock-like signatures in breast cancer

Algorithms and Complexities of Matching Variants in Covariate Balancing

Network flow methods for the minimum covariate imbalance problem

A unified approach for a 1D generalized total variation problem

The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

Applications and efficient algorithms for integer programming problems on monotone constraints

Complexity and approximations for submodular minimization problems on two variables per inequality constraints

Identifying Drug Sensitivity Subnetworks with NETPHIX

Algorithms and complexity of range clustering

A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem

The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem

Complexity, algorithms and applications of the integer network flow with fractional supplies problem

Isolation branching: a branch and bound algorithm for the k-terminal cut problem

Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing

Methodologies and Algorithms for Group-Rankings Decision

A fully polynomial time approximation scheme for the Replenishment Storage problem

Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut

A Graph-Theoretic Approach for Spatial Filtering and Its Impact on Mixed-Type Spatial Pattern Recognition in Wafer Bin Maps

Complexity of some inverse shortest path lengths problems

Solving the Convex Cost Integer Dual Network Flow Problem

A Better Decision Tree: The Max-Cut Decision Tree with Modified PCA Improves Accuracy and Running Time

HNCcorr: combinatorial optimization for neuron identification

Suchergebnisse filtern