Wyszukiwarka
Nie znaleźliśmy wyników w zadanych kryteriach!
Ale mamy wyniki w innych katalogach.Filtry
wszystkich: 26888
-
Katalog
- Publikacje 5126 wyników po odfiltrowaniu
- Czasopisma 102 wyników po odfiltrowaniu
- Konferencje 27 wyników po odfiltrowaniu
- Osoby 114 wyników po odfiltrowaniu
- Projekty 4 wyników po odfiltrowaniu
- Kursy Online 38 wyników po odfiltrowaniu
- Wydarzenia 3 wyników po odfiltrowaniu
- Dane Badawcze 21474 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: PROXIMAL ALGORITHM WITH MEMORY PRIMAL–DUAL ALGORITHM BEST APPROXIMATION OF THE KUHN–TUCKER SET INCLUSIONS WITH MAXIMALLY MONOTONE OPERATORS ATTRACTION PROPERTY IMAGE RECONSTRUCTION
-
Proximal primal–dual best approximation algorithm with memory
PublikacjaWe propose a new modified primal–dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous...
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublikacjaWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublikacjaWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublikacjaDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
The Usage of the BP-Layers Stereo Matching Algorithm with the EBCA Camera Set
PublikacjaThis paper is concerned with applying a stereo matching algorithm called BP-Layers to a set of many cameras. BP Layers is designed for obtaining disparity maps from stereo cameras. The algorithm takes advantage of convolutional natural networks. This paper presents using this algorithm with a set called Equal Baseline Camera Array. This set consists of up to five cameras with one central camera and other ones aground it. Such a...
-
an intelligent image processing sensor - the algorithm and the hardware implementation
PublikacjaW artykule przedstawiono algorytm przeznaczony do rozpoznawania obiektów ruchomych w obrazie do celu analizy ruchu pojazdów. Algorytm został zrealizowany w układzie FPGA.Ang.: This paper describes the idea and theimplementation of the robust algorithm dedicated toextraction of moving vehicles from real-time cameraimages for the evaluation of traffic parameters, suchas the number of vehicles, their direction of movementand their...
-
Convex set of quantum states with positive partial transpose analysed by hit and run algorithm
PublikacjaThe convex set of quantum states of a composite K×K system with positive partial transpose is analysed. A version of the hit and run algorithm is used to generate a sequence of random points covering this set uniformly and an estimation for the convergence speed of the algorithm is derived. For K >3 or K=3 this algorithm works faster than sampling over the entire set of states and verifying whether the partial transpose is positive....
-
An EIT reconstruction algorithm based on noisy data.
PublikacjaPraca przedstawia algorytm rekonstrukcji oparty o zmodyfikowany algorytm Gaussa - Newtona. Algorytm uwzględnia istnienie elektrod pomiarowych w tomografii elektroimpedancyjnej. Elektrody charakteryzują się rozmiarem i impedancją. Dodatkowo algorytm zakłada istnienie szumu w sygnale mierzonym. Zostało pokazane, że dobór optymalnego wzorca pobudzenia znacząco poprawia odporność algorytmu rekonstrukcyjnego na szum w danych. Dwie...