Výsledky vyhľadávania - "fast algorithms"

Fast algorithms for maximizing the minimum eigenvalue in fixed dimension Autor Brown, Adam, Laddha, Aditi, Singh, Mohit

“…))-time randomized algorithm that finds an assignment subject to a partition constraint whose minimum eigenvalue is at least (1−ϵ…”
Získať plný text

Fast algorithms for maximizing monotone nonsubmodular functions Autor Liu, Bin, Hu, Miaomiao

“… subject to certain constraints. Our first result is a simple algorithm that gives a ( 1 - e - γ - ϵ ) -approximation for a cardinality constraint using O…”
Získať plný text

Fast algorithms of computing admissible intervals for discrete distributions with single parameter Autor Wang, Weizhen, Yu, Chongxiu, Zhang, Zhongzhan

“…) in a binomial distribution, the number of subjects with a certain attribute (M) or the total number of subjects (N…”
Získať plný text

Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks Autor Chee Wei Tan, Mung Chiang, Srikant, R.

“…In this paper, we consider a wireless network where interference is treated as noise, and we study the nonconvex problem of sum rate maximization by power…”
Získať plný text

Fast algorithms for nonuniform Chirp-Fourier transform Autor Sun, Yannan, Qian, Wenchao

“… The key to its application lies in the sampling and fast algorithms. In practical applications, nonuniform sampling can be caused by sampling equipment and other reasons…”
Získať plný text

Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy Autor Zhang, Xiaojuan, Liu, Qian, Li, Min, Zhou, Yang

“…In this paper, we concentrate on exploring fast algorithms for the minimization of a non-increasing supermodular or non-supermodular function f subject to a cardinality constraint…”
Získať plný text

Fast algorithms for joint power control and scheduling in wireless networks Autor Fu, Liqun, Liew, Soung Chang, Huang, Jianwei

“…This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR…”
Získať plný text

On High-Order Denoising Models and Fast Algorithms for Vector-Valued Images Autor Brito-Loeza, Carlos, Chen, Ke

“… AMS subject classifications: 68U10, 65F10, 65K10…”
Získať plný text

INTERPOLATION AND SMOOTHING L-SPLINES, FAST ALGORITHMS Autor Kounchev, Ognyan, Tsachev, Tsvetomir

“…We study fast algorithms for interpolation and smoothing by means of the one-dimensional L-splines, to which the computation of the polysplines is reduced…”
Získať plný text

Fast algorithms for nonparametric population modeling of large data sets Autor Pillonetto, Gianluigi, De Nicolao, Giuseppe, Chierici, Marco, Cobelli, Claudio

“…Population models are widely applied in biomedical data analysis since they characterize both the average and individual responses of a population of subjects…”
Získať plný text

Fast algorithms for structured robust principal component analysis Autor Ayazoglu, M., Sznaier, M., Camps, O. I.

“…A large number of problems arising in computer vision can be reduced to the problem of minimizing the nuclear norm of a matrix, subject to additional structural and sparsity constraints on its elements…”
Získať plný text

Fast Algorithms for Sampled Multiband Signals Autor Karnik, Santhosh

“…The objective of this thesis is to present a variety of fast algorithms for working with samples of multiband signals…”
Získať plný text

Characterization and Comparison of the 10-2 SITA-Standard and Fast Algorithms Autor Bakshi, Erez, Barkana, Yaniv, Goldich, Yakov, Morad, Yair, Kaplan, Audrey, Avni, Isaac, Zadok, David

“… Each subject performed 10-2 SITA-standard and SITA-fast tests. Within 2 months this sequence of tests was repeated. Results: SITA-fast was 30…”
Získať plný text

Fast algorithms for k-submodular maximization subject to a matroid constraint Autor Niu, Shuxian, Liu, Qian, Zhou, Yang, Li, Min

“…In this paper, we apply a Threshold-Decreasing Algorithm to maximize \(k\)-submodular functions under a matroid constraint, which reduces the query complexity…”
Získať plný text

Phase Function Methods for Second Order Inhomogeneous Linear Ordinary Differential Equations Autor Serkh, Kirill, Bremer, James

“…It has long been known that second order linear homogeneous ordinary differential equations with nonoscillatory coefficients admit nonoscillatory phase…”
Získať plný text

Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) Autor Cattell, Kevin, Ruskey, Frank, Sawada, Joe, Serra, Micaela, Miers, C.Robert

“…Many applications call for exhaustive lists of strings subject to various constraints, such as inequivalence under group actions…”
Získať plný text

Design and Digital Implementation of Fast and Recursive DCT II–IV Algorithms Autor M. Perera, Sirani, Madanayake, Arjuna, Dornback, Nathan, Udayanga, Nilan

“…Using the proposed factorizations of discrete cosine transform (DCT) matrices, fast and recursive algorithms are stated. In this paper, signal flow graphs for…”
Získať plný text

Fast Algorithms for Centro-Symmetric and Centro-Skewsymmetric Toeplitz-Plus-Hankel Matrices Autor Heinig, Georg, Rost, Karla

“… Fast algorithms are presented that solve an n×n system of equations with O(n2) operations in sequential and O(n…”
Získať plný text

Symmetry in Applied Mathematics

“…Applied mathematics and symmetry work together as a powerful tool for problem reduction and solving. We are communicating applications in probability theory…”
Získať plný text

Realizable Spatio-Temporal Tomlinson-Harashima Precoders: Theory and Fast Computation Autor Wahls, S., Boche, H.

“…) but nevertheless ensure that the precoder can be operated in real-time subject to a finite latency time which can be chosen by the system designer…”
Získať plný text