Filters








31 Hits in 4.4 sec

Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution [article]

Karl Bringmann, Nick Fischer, Vasileios Nakos
2021 arXiv   pre-print
Our algorithm is a blend of algebraic and combinatorial ideas and techniques. Additionally, we provide two fast Las Vegas algorithms for computing sparse nonnegative convolutions.  ...  In this paper we present the first deterministic near-linear-time algorithm for computing sparse nonnegative convolutions.  ...  In addition to our new deterministic algorithm, we improve the state-of-the-art Las Vegas algorithms for sparse nonnegative convolutions in two regards: simplicity and efficiency.  ... 
arXiv:2107.07625v1 fatcat:dwbpi55cnzh4tf4lvrlqx3ztsi

Clustered Integer 3SUM via Additive Combinatorics [article]

Timothy M. Chan, Moshe Lewenstein
2015 arXiv   pre-print
The first truly subquadratic algorithm for 1a. computing the (min,+) convolution for monotone increasing sequences with integer values bounded by O(n), 1b. solving 3SUM for monotone sets in 2D with integer  ...  The first algorithm for histogram indexing for any constant alphabet size that achieves truly subquadratic preprocessing time and truly sublinear query time. 3.  ...  ) convolution of two sparse vectors and presented a Las Vegas algorithm that runs in time sensitive to the number of nonzero entries in the output vector; computing the sumset A + B can be viewed as an  ... 
arXiv:1502.05204v1 fatcat:kl2im46raffwphoawezco6rboy

Energy Efficient Optimization for Wireless Virtualized Small Cell Networks With Large-Scale Multiple Antenna

Zheng Chang, Zhu Han, Tapani Ristaniemi
2017 IEEE Transactions on Communications  
Ristaniemi, "Second Order Im- propriety based Complex-valued Algorithm for Frequency-domain Blind Separation of Convolutive Speech Mixtures", Proc.  ...  IEEE Consumer Communications and Network- ing Conference (CCNC), Las Vegas, NV, January 2013. 47. F. Cong, A.H Phan, P. Astikainen, Q. Zhao, J.K. Hietanen, T. Ristaniemi and A.  ... 
doi:10.1109/tcomm.2017.2666182 fatcat:6plxmq45urbq5fnideivv64mia

Hamming distance completeness and sparse matrix multiplication [article]

Daniel Graf, Karim Labib, Przemysław Uznański
2018 arXiv   pre-print
The resulting algorithms for ℓ_2p+1 Pattern Matching and All Pairs ℓ_2p+1, for 2p+1 = 3,5,7,... are new.  ...  This means that the current upperbounds by Yuster (SODA'09) cannot be improved without improving the sparse matrix multiplication algorithm by Yuster and Zwick (ACM TALG'05) and vice versa.  ...  Theorem 7 . 4 . 74 For N ≥ n, the multiplication problem in Sparse(n, N, n; N, N ) reduces under a randomized (Las Vegas) reduction to an APHam instance with O(n) vectors of dimension O(N/n).  ... 
arXiv:1711.03887v2 fatcat:24ykc3ag75dp7m66bvsxprlpum

A Unified Approach to Sparse Signal Processing [article]

F. Marvasti, A. Amini, F. Haddadi, M. Soltanolkotabi, B. H. Khalaj, A. Aldroubi, S. Holm, S. Sanei, J. Chambers
2009 arXiv   pre-print
The methods of Prony, Pisarenko, and MUSIC are next discussed for sparse frequency domain representations.  ...  For each of these fields, various algorithms and techniques, which have been developed to leverage sparsity, are described succinctly.  ...  Marvasti and lectured by Profs. E. Candes, R. Baraniuk, P. Marziliano, and Dr. A. Cichoki, ICASSP 2008, Las Vegas, May 2008.  ... 
arXiv:0902.1853v1 fatcat:lxd3crtgd5fl5ofshryzm5pkfi

Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum [article]

Karl Bringmann, Vasileios Nakos
2021 arXiv   pre-print
We design an algorithm running in time Õ(k^4/3), by a combination of sparse convolution and sumset estimates considered in Additive Combinatorics.  ...  Using a diverse toolkit containing techniques such as color coding, sparse recovery, and sumset estimates, we make considerable progress towards this question and design an algorithm running in time Õ(  ...  The ultimate goal of near-linear output-sensitive time has been achieved by Cole and Hariharan [19] for non-negative vectors by a Las Vegas algorithm, in [37] for general vectors by a Monte Carlo algorithm  ... 
arXiv:2107.13206v1 fatcat:isbp6chx2zhrxdr56bydlum5wy

A unified approach to sparse signal processing

Farokh Marvasti, Arash Amini, Farzan Haddadi, Mahdi Soltanolkotabi, Babak Hossein Khalaj, Akram Aldroubi, Saeid Sanei, Janathon Chambers
2012 EURASIP Journal on Advances in Signal Processing  
For each of these fields, various algorithms and techniques, which have been developed to leverage sparsity, are described succinctly.  ...  The Error Locator Polynomial (ELP) and iterative methods are shown to work quite effectively for both sampling and coding applications.  ...  Holm from University of Oslo who contributed a section in sparse array design, M. Nouri Moghadam, the director of the Newton Foundation, H. Saeedi from University of Massachusetts, and K.  ... 
doi:10.1186/1687-6180-2012-44 fatcat:sbby5qh65bh5jd57i567br7el4

A unified approach to sparse signal processing

Farokh Marvasti, Arash Amini, Farzan Haddadi, Mehdi Soltanolkotabi, Babak Khalaj, Akram Aldroubi, Saeid Sanei, Jonathon Chambers
2012 EURASIP Journal on Advances in Signal Processing  
For each of these fields, various algorithms and techniques, which have been developed to leverage sparsity, are described succinctly.  ...  The Error Locator Polynomial (ELP) and iterative methods are shown to work quite effectively for both sampling and coding applications.  ...  Holm from University of Oslo who contributed a section in sparse array design, M. Nouri Moghadam, the director of the Newton Foundation, H. Saeedi from University of Massachusetts, and K.  ... 
doi:10.1186/preaccept-1686979482577015 fatcat:7zjru2zjpne3rceluc5empoanq

Spot noise texture synthesis for data visualization

Jarke J. van Wijk
1991 Proceedings of the 18th annual conference on Computer graphics and interactive techniques - SIGGRAPH '91  
with a variety of other techniques, such as random faults, tittering, sparse convolution, and particle systems, are discussed.  ...  Current techniques for texture synthesis are not suitable, because they do not provide local control, and are not suited for the design of textures.  ...  Ren6 Huijsmans. and Hans van der Kam (Maritime Research Institute Netherlands -MARIN ) for providing interesting data sets, for the pleasant cooperation, and for their support of the ECN Scientific Visualization  ... 
doi:10.1145/122718.122751 dblp:conf/siggraph/Wijk91 fatcat:q7slnsuf7bfzniegsxqlbn2ct4

Spot noise texture synthesis for data visualization

Jarke J. van Wijk
1991 Computer graphics  
with a variety of other techniques, such as random faults, tittering, sparse convolution, and particle systems, are discussed.  ...  Current techniques for texture synthesis are not suitable, because they do not provide local control, and are not suited for the design of textures.  ...  Ren6 Huijsmans. and Hans van der Kam (Maritime Research Institute Netherlands -MARIN ) for providing interesting data sets, for the pleasant cooperation, and for their support of the ECN Scientific Visualization  ... 
doi:10.1145/127719.122751 fatcat:azpbydhps5fahmphbgfledthhq

Unit commitment considering multiple charging and discharging scenarios of plug-in electric vehicles

Zhile Yang, Kang Li, Qun Niu, Aoife Foley
2015 2015 International Joint Conference on Neural Networks (IJCNN)  
Kjaer, Maurizio Campolo, Fabio La Foresta and Francesco C.  ...  Fergus P212 Real-Time Video Object Recognition Using Convolutional Neural Network [#15632] Byungik Ahn P213 A novel dictionary learning algorithm for image representation [#15793] Mouna Dammak, Mahmoud  ... 
doi:10.1109/ijcnn.2015.7280446 dblp:conf/ijcnn/YangLNF15 fatcat:6xlakikcfzfyhhm2spooe2j7ra

Index

1999 Linear Algebra and its Applications  
Johnson, Possible inertia combinations in the Stein and Lyapunov equations 222 (1995) 227 Dean, A. and J.A. de la Pen Ä a, Algorithms for weakly nonnegative quadratic forms 235 (1996) 35 Debro, K.E., see  ...  Wang, Numerical solutions for large sparse quadratic eigenvalue problems 225 (1995) 57 Guo, W., An inverse eigenvalue problem for nonnegative matrices 249 (1996) 67 Guo, W., Eigenvalues of nonnegative  ...  ., Rotation and Lorentz transformations in 2´2 and 2´4 complex matrices and in polarized-light physics 254 (1997) 383 Nowicki, A., On the nonexistence of rational ®rst integrals for systems of linear dierential  ... 
doi:10.1016/s0024-3795(99)00243-8 fatcat:xz5sbc3lzngydobg3ln6xp2cum

Subcubic Equivalences Between Path, Matrix, and Triangle Problems

Virginia Vassilevska Williams, R. Ryan Williams
2018 Journal of the ACM  
Building on our techniques, we give two improved BMM algorithms: a derandomization of the combinatorial BMM algorithm of Bansal and Williams (FOCS'09), and an improved quantum algorithm for BMM.  ...  (APSP) also has an O (n 3 ) time algorithm on n-node graphs, known for over 40 years [29, 69] .  ...  ACKNOWLEDGMENTS The authors thank the anonymous referees for their insightful and detailed comments and Laszlo Kozma for suggesting to study the Maximum Subarray problem in this context.  ... 
doi:10.1145/3186893 fatcat:i3zdmcdup5gana3kgbrbvmdwe4

Image splicing detection with local illumination estimation

Yu Fan, Philippe Carre, Christine Fernandez-Maloigne
2015 2015 IEEE International Conference on Image Processing (ICIP)  
It will show how these ideas are incorporated in convolutional neural networks (for images) and recurrent neural networks (for capturing sequential structure) .  ...  Thus, they exhibit the kind of sparse behavior that has been exploited by researchers in recent years for designing second-generation algorithms for image compression (JPEG 2000) , compressed sensing,  ...  Concluding the Show & Tell session will be a section concentrating on why the sensory gap is important to consider for practical applications, such as annotation tools, and image learning and mining systems  ... 
doi:10.1109/icip.2015.7351341 dblp:conf/icip/FanCF15 fatcat:7ja5gjnp5rafvedc2nman7xcru

Data Provenance

Peter Buneman, Wang-Chiew Tan
2019 SIGMOD record  
We then use these conditions as the basis for database repair algorithms that provide provable fairness guarantees about classifiers trained on their training labels.  ...  In this paper, we establish conditions under which a commonly used sufficient condition for invariant confluence is both necessary and sufficient, and we use this condition to design a general-purpose  ...  The content is solely the responsibility of the authors and does not necessarily represent the official views of the NIH. We thank NVIDIA Corporation for donating the Titan Xp GPU used for this work.  ... 
doi:10.1145/3316416.3316418 fatcat:u4lmbha4fjgajlc46r66ryh7vi
« Previous Showing results 1 — 15 out of 31 results