Filters








345 Hits in 6.2 sec

Optimization Problems and Algorithms from Computer Science [chapter]

Heiko Rieger
2009 Encyclopedia of Complexity and Systems Science  
To study the size distribution of these 416 objects one projects these bundles on the basal plane, as in-417 dicated in Fig.  , where a bundle projects onto a connected 418 cluster.  ...  th section, we discuss minimum cost 186 flow problems on weighted graphs and its solution via the 187 where n i =  if the path passes bond i (i. e. i P) and n i =  233 otherwise. 234 One is interested  ... 
doi:10.1007/978-0-387-30440-3_378 fatcat:uo5ldhh32fh47puy5347wxgm5i

Controlling transient gas flow in real-world pipeline intersection areas

Felix Hennings, Lovis Anderson, Kai Hoppmann-Baum, Mark Turner, Thorsten Koch
2020 Optimization and Engineering  
Due to their complexity and lack of data compressor stations are usually dealt with in the scientific literature in a highly simplified and idealized manner.  ...  Located at intersection areas of the network, they are contained in huge complex plants, where they are in combination with valves and regulators responsible for routing and pushing the gas through the  ...  Acknowledgements The work for this article has been conducted in the Research Campus MODAL funded by the German Federal Ministry of Education and Research (BMBF) (fund number 05M14ZAM).  ... 
doi:10.1007/s11081-020-09559-y fatcat:g6woahq2j5exfcc5ejv23pku64

A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems [article]

Jörg H. Kappes, Bjoern Andres, Fred A. Hamprecht, Christoph Schnörr, Sebastian Nowozin, Dhruv Batra, Sungwoong Kim, Bernhard X. Kausler, Thorben Kröger, Jan Lellmann, Nikos Komodakis, Bogdan Savchynskyy, Carsten Rother
2014 arXiv   pre-print
However, on new and challenging types of models our findings disagree and suggest that polyhedral methods and integer programming solvers are competitive in terms of runtime and solution quality over a  ...  To ensure reproducibility, we evaluate all methods in the OpenGM 2 framework and report extensive results regarding runtime and solution quality.  ...  We thank Rick Szeliski and Pushmeet Kohli for inspiring discussions.  ... 
arXiv:1404.0533v1 fatcat:eh2mhtz2dngnjh4uhzscw2w7c4

A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems

Jörg H. Kappes, Bjoern Andres, Fred A. Hamprecht, Christoph Schnörr, Sebastian Nowozin, Dhruv Batra, Sungwoong Kim, Bernhard X. Kausler, Thorben Kröger, Jan Lellmann, Nikos Komodakis, Bogdan Savchynskyy (+1 others)
2015 International Journal of Computer Vision  
However, on new and challenging types of models our findings disagree and suggest that polyhedral methods and integer programming solvers are competitive in terms of runtime and solution quality over a  ...  To ensure reproducibility, we evaluate all methods in the OpenGM 2 framework and report extensive results regarding runtime and solution quality.  ...  We thank Rick Szeliski and Pushmeet Kohli for inspiring discussions.  ... 
doi:10.1007/s11263-015-0809-x fatcat:62xje37yzffsfgw76hhflwiyt4

Convex Optimization for Parallel Energy Minimization [article]

K. S. Sesh Kumar, Alvaro Barbero, Stefanie Jegelka, Francis Bach (LIENS,INRIA Paris - Rocquencourt)
2015 arXiv   pre-print
With growing image sizes (2D and 3D), it is now highly desirable to run energy minimization algorithms in parallel.  ...  On small problems the iterative convex methods match the combinatorial max-flow algorithms, while on larger problems they offer other flexibility and important gains: (a) their memory footprint is small  ...  use the ensuing solutions to speed up the medium and high weight regimes.  ... 
arXiv:1503.01563v1 fatcat:ge6qk5hvefcfpmk6jjvhka2m7a

A multi-objective approach for Dynamic Airspace Sectorization using agent based and geometric models

Jiangjun Tang, Sameer Alam, Chris Lokan, Hussein A. Abbass
2012 Transportation Research Part C: Emerging Technologies  
However, these approaches suffer from several operational drawbacks, and their computational complexity increases fast as the airspace size and traffic volume increase.  ...  Flight trajectory clustering A common approach is to cluster the flights based on their trajectories (Brinton and Pledgie, 2008) .  ...  Acknowledgements The authors wish to acknowledge the useful discussions with AirServices Australia and EUROCONTROL CND, Brétigny.  ... 
doi:10.1016/j.trc.2011.08.008 fatcat:s4viu3byqbd2nmhuo4f6pxgmbq

The Semantic Mutex Watershed for Efficient Bottom-Up Semantic Instance Segmentation [article]

Steffen Wolf, Yuyan Li, Constantin Pape, Alberto Bailoni, Anna Kreshuk, Fred A. Hamprecht
2019 arXiv   pre-print
It optimizes an objective function closely related to the Symmetric Multiway Cut objective and empirically shows efficient scaling behavior.  ...  We propose a greedy algorithm for joint graph partitioning and labeling derived from the efficient Mutex Watershed partitioning algorithm.  ...  In more detail, in this contribution we: • propose a fast algorithm for joint graph partitioning and labeling • prove that the algorithm minimizes (exactly) an objective function closely related to the  ... 
arXiv:1912.12717v1 fatcat:bw4cz3srfvekzbbigoi4nqxf24

Assignment Flows for Data Labeling on Graphs: Convergence and Stability [article]

Artjom Zern, Alexander Zeilmann, Christoph Schnörr
2021 arXiv   pre-print
Vertices of a given graph index the data points and define a system of neighborhoods.  ...  Furthermore, we classify attractors of the flow and quantify corresponding basins of attraction.  ...  This is not the case for segmentation based on spectral clustering [27] as discussed in detail and demonstrated by [35] .  ... 
arXiv:2002.11571v2 fatcat:pco2ql44uratbayhe4vjyrwcdm

On the Uniform Convergence of the Orthogonal Series-Type Kernel Regression Neural Networks in a Time-Varying Environment [chapter]

Meng Joo Er, Piotr Duda
2012 Lecture Notes in Computer Science  
Models for a Computationally Efficient Predictive Control Algorithm 126 Maciej Lawrynczuk Vladimir Olej and Jana Filipova Spectra of the Spike-Flow Graphs in Geometrically Embedded Neural Networks  ...  of Convex Polytope 448 Rafal Zdunek Part IV: Computer Vision, Image and Speech Analysis Comparison of Corner Detectors for Revolving Objects Matching Task 459 Grzegorz Bagrowski and Marcin  ... 
doi:10.1007/978-3-642-29347-4_5 fatcat:pqwbzeuqsbg6lkhlmmrsj6qb24

Geometric Combinatorics of Transportation Polytopes and the Behavior of the Simplex Method [article]

Edward D. Kim
2010 arXiv   pre-print
We also study certain classes of network flow polytopes and prove new linear upper bounds for their diameters.  ...  This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming.  ...  For example, Klee and Kleinschmidt (see Section 7.7 in [181]) show that Theorem 2.3.10 holds for the ridge-graphs of all pure simplicial complexes, and more general objects.  ... 
arXiv:1006.2416v1 fatcat:xahucjplsraa3gbzbwkrr2u5ty

Modeling Virus Self-Assembly Pathways: Avoiding Dynamics Using Geometric Constraint Decomposition

Meera Sitharam, Mavis Agbandje-Mckenna
2006 Journal of Computational Biology  
from combinatorial and computational algebra, geometry and algebraic complexity.  ...  The model is analyzable and refinable and avoids expensive dynamics.  ...  For example Figures 4 and 5, and Figure 3 show a 3D and 2D constraint graphs.  ... 
doi:10.1089/cmb.2006.13.1232 pmid:16901239 fatcat:p7ae2s5b5fahxd3wichg24dfw4

The geometry of on-shell diagrams

Sebastián Franco, Daniele Galloni, Alberto Mariotti
2014 Journal of High Energy Physics  
We perform a detailed investigation of the combinatorial and geometric objects associated to these graphs.  ...  We mainly focus on their relation to polytopes and toric geometry, the Grassmannian and its stratification.  ...  The work of S.F and D. G. is supported by the U.K. Science and Technology Facilities Council (STFC). A.M. acknowledges funding by the Durham International Junior Research Fellowship.  ... 
doi:10.1007/jhep08(2014)038 fatcat:lbb72t7bxvaxdc4sek4evpy3iq

Hierarchical Optimal Transport for Multimodal Distribution Alignment [article]

John Lee, Max Dabagia, Eva L. Dyer, Christopher J. Rozell
2019 arXiv   pre-print
the largest cluster.  ...  When the transformation between two datasets is unitary, we provide performance guarantees that describe when and how well aligned cluster correspondences can be recovered with our formulation, as well  ...  Acknowledgments JL was supported by DSO National Laboratories of Singapore, ED and MD were supported by NSF grant IIS-1755871, and CR was supported by NSF grant CCF-1409422 and CAREER award CCF-1350954  ... 
arXiv:1906.11768v2 fatcat:kj27rnookrcqdh7ms2dt6jr6kq

On Computing Mapping of 3D Objects

Xin Li, S. S. Iyengar
2014 ACM Computing Surveys  
We review the computation of 3D geometric data mapping, which establishes one-to-one correspondence between or among spatial/spatiotemporal objects.  ...  Different mapping algorithms are discussed and compared according to their formulations of objective functions, constraints, and optimization strategies.  ...  compute the dual graph and apply a clustering based on the inner/interpart connectivity.  ... 
doi:10.1145/2668020 fatcat:rcwzp5d4azb7xkaquyfc3l3reu

Fast and Robust Comparison of Probability Measures in Heterogeneous Spaces [article]

Ryoma Sato, Marco Cuturi, Makoto Yamada, Hisashi Kashima
2021 arXiv   pre-print
However, its exact computation is intractable, and most algorithms that claim to approximate it remain expensive.  ...  (AW) distances, which are respectively the energy and Wasserstein distances instantiated on such representations.  ...  B.5 Graph Model Comparison (Q5) We use the official implementation of GraphRNN https://github.com/JiaxuanYou/graph-generation for the GraphRNN, ER model, and BA model.  ... 
arXiv:2002.01615v3 fatcat:yxjxda44pza3xdmbo2iqkaeqgi
« Previous Showing results 1 — 15 out of 345 results