Search results for "Algorithm"
showing 7 items of 4887 documents
Reliable Outer Bounds for the Dual Simplex Algorithm with Interval Right-hand Side
2013
International audience; In this article, we describe the reliable computation of outer bounds for linear programming problems occuring in linear relaxations derived from the Bernstein polynomials. The computation uses interval arithmetic for the Gauss-Jordan pivot steps on a simplex tableau. The resulting errors are stored as interval right hand sides. Additionally, we show how to generate a start basis for the linear programs of this type. We give details of the implementation using OpenMP and comment on numerical experiments.
Generating TV summaries for CE-devices
2002
Automatically generated summaries of TV content are indispensable for content selection and navigation in CE-devices. We show two different types of summaries: Short video trailers and visual overviews consisting of representative frames. The demo does not only show the feasibility of the proposed algorithms, but also shows how different types of generated summaries can be used in future CE-devices.
AnatomySketch : An Extensible Open-Source Software Platform for Medical Image Analysis Algorithm Development
2021
AbstractThe development of medical image analysis algorithm is a complex process including the multiple sub-steps of model training, data visualization, human–computer interaction and graphical user interface (GUI) construction. To accelerate the development process, algorithm developers need a software tool to assist with all the sub-steps so that they can focus on the core function implementation. Especially, for the development of deep learning (DL) algorithms, a software tool supporting training data annotation and GUI construction is highly desired. In this work, we constructed AnatomySketch, an extensible open-source software platform with a friendly GUI and a flexible plugin interfac…
Sparsity-aware multiple relay selection in large multi-hop decode-and-forward relay networks
2016
In this paper, we propose and investigate two novel techniques to perform multiple relay selection in large multi-hop decode-and-forward relay networks. The two proposed techniques exploit sparse signal recovery theory to select multiple relays using the orthogonal matching pursuit algorithm and outperform state-of-the-art techniques in terms of outage probability and computation complexity. To reduce the amount of collected channel state information (CSI), we propose a limited-feedback scheme where only a limited number of relays feedback their CSI. Furthermore, a detailed performance-complexity tradeoff investigation is conducted for the different studied techniques and verified by Monte …
Modelling and analysing oriented fibrous structures
2014
Abstract. A mathematical model for fibrous structures using a direction dependent scaling law is presented. The orientation of fibrous nets (e.g. paper) is analysed with a method based on the curvelet transform. The curvelet-based orientation analysis has been tested successfully on real data from paper samples: the major directions of fibrefibre orientation can apparently be recovered. Similar results are achieved in tests on data simulated by the new model, allowing a comparison with ground truth. peerReviewed
Ģenētiskais algoritms optimizācijas metodēs
2017
Bakalaura darbā tiek aprakstīts ģenētiskais algoritms, kas ir viens no optimizācijas metožu jaunākajiem un mazāk pazīstamajiem algoritmiem. Teorijas apskatā aplūkots ģenētiskā algoritma konstrukcijas elementi: derīguma (fitness) funkcijas izveide, reproducēšanās, krustošanās un mutāciju operatori. Praktiskajā pielietojumu daļā apskatīti vairāki piemēri (tanī skaitā ceļojošā pārdevēja problēma). Piemēru realizācija veikta ar paketi R .Sniegts neliels metožu salīdzinājums.
On the Amount of Nonconstructivity in Learning Recursive Functions
2011
Nonconstructive proofs are a powerful mechanism in mathematics. Furthermore, nonconstructive computations by various types of machines and automata have been considered by e.g., Karp and Lipton [17] and Freivalds [11]. They allow to regard more complicated algorithms from the viewpoint of much more primitive computational devices. The amount of nonconstructivity is a quantitative characterization of the distance between types of computational devices with respect to solving a specific problem. In the present paper, the amount of nonconstructivity in learning of recursive functions is studied. Different learning types are compared with respect to the amount of nonconstructivity needed to lea…