Filters








446 Hits in 6.7 sec

Rank inequalities and separation algorithms for packing designs and sparse triple systems

Lucia Moura
2003 Theoretical Computer Science  
Subpacking and l-sparseness inequalities are introduced and studied. They can be regarded as rank inequalities for the independence systems associated with these designs.  ...  Separation algorithms for these inequalities are proposed. We incorporate some of the sparseness inequalities in a polyhedral algorithm, and determine maximal 4-sparse PSTS(v); v 6 16.  ...  The author would like to thank an anonymous referee for the careful reading and useful comments.  ... 
doi:10.1016/s0304-3975(02)00648-5 fatcat:2tlfobpt7rfvvhqzqm77uuz434

Author index

2003 Theoretical Computer Science  
., Rank inequalities and separation algorithms for packing designs and sparse triple systems (1-3) 367-384 Nanni, U., see S. Cicerone (1-3)  ...  Frigioni and U. Nanni, A fully dynamic algorithm for distributed shortest paths (1-3) 83-102 Cohen, M.B. and C.J.  ... 
doi:10.1016/s0304-3975(03)00124-5 fatcat:ixtkkstovvbd3l6njhzwhde2xy

Page 2747 of Mathematical Reviews Vol. , Issue 2004d [page]

2004 Mathematical Reviews  
Swartz (1-CRNL; Ithaca, NY) 2004d:05047 05B40 05B07 52Ci7 Moura, Lucia (3-OTTW-ITE; Ottawa, ON) Rank inequalities and separation algorithms for packing designs and sparse triple systems.  ...  In this paper, in- equalities and facets for the packing polytopes for packings of strength and block size k are established, and additional inequal- ities are introduced to examine packings forbidding  ... 

Learning from Comparisons and Choices [article]

Sahand Negahban and Sewoong Oh and Kiran K. Thekumparampil and Jiaming Xu
2018 arXiv   pre-print
This provides a guideline for designing surveys when one can choose which items are to be compared.  ...  This also allows one to compute similarities among users and items to be used for categorization and search.  ...  SO and KT acknowledge support from NSF grants CCF 1553452, CNS 1527754, CCF 1705007, and RI 1815535. The authors acknowledge Yu Lu and Ruoyu Sun for helpful and fruitful discussions.  ... 
arXiv:1704.07228v2 fatcat:mkmxc7pbiremnid2vzpu5p662e

Network Coding Theory: A Survey

Riccardo Bassoli, Hugo Marques, Jonathan Rodriguez, Kenneth W. Shum, Rahim Tafazolli
2013 IEEE Communications Surveys and Tutorials  
The deployment of many tools from combinatorics and graph theory helped the design of algorithms with reduced complexity.  ...  The link with matroid theory and the results obtained in information theory about information inequalities provided researchers a strong background to face the capacity and solvability issues of network  ...  tree packing algorithm.  ... 
doi:10.1109/surv.2013.013013.00104 fatcat:jgnf4i7rczfqrcyv7tygrydtxm

Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations

V. Y. F. Tan, L. Balzano, S. C. Draper
2012 IEEE Transactions on Information Theory  
To this end, we derive distance properties of equiprobable and sparse rank-metric codes.  ...  Finally, we provide a non-exhaustive procedure to search for the unknown low-rank matrix.  ...  Acknowledgements The authors would like to thank Ying Liu (MIT) for his detailed comments. The authors would also like to thank Huili Guo (MIT) for her help in generating Fig. 2 .  ... 
doi:10.1109/tit.2011.2178017 fatcat:buijac3fana2louxc4u2rlwgym

Chapter 10: Algebraic Algorithms [article]

Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas
2013 arXiv   pre-print
Diaz-Herrera, editors, covers Algebraic Algorithms, both symbolic and numerical, for matrix computations and root-finding for polynomials and systems of polynomials equations.  ...  We cover part of these large subjects and include basic bibliography for further study.  ...  A highly efficient tool is FGb for Gröbner basis, and RS for the rational univariate representation, and real solutions of systems of polynomial equations and inequalities.  ... 
arXiv:1311.3731v1 fatcat:whtgwztbmbgqbl44s4e663oulu

Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods

Jacek Błaszczyk, Andrzej Karbowski, Krzysztof Malinowski
2007 International Journal of Applied Mathematics and Computer Science  
Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods The main purpose of this paper is to describe the design, implementation and possibilities  ...  of our object-oriented library of algorithms for dynamic optimization problems.  ...  The slowest matrix solver was UMFPACK, designed for general matrices, and the WSMP solver, operating on the full linear system.  ... 
doi:10.2478/v10006-007-0043-y fatcat:wpg2cb4zv5bidlitedr4dblh7a

Strong Algorithms for the Ordinal Matroid Secretary Problem [chapter]

José A. Soto, Abner Turkieltaub, Victor Verdugo
2018 Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms  
We devise an O(1) intersection-competitive algorithm, an O(log ρ) probability-competitive algorithm and an O(log log ρ) ordinal-competitive algorithm for matroids of rank ρ.  ...  We also get constant ratios for hypergraphic matroids, for certain gammoids and for graph packing matroids that generalize matching matroids.  ...  Let R ⊆ V be a set of vertices called terminals and consider the independence system M(R, G, H) over R whose independent sets are all X ⊆ R for which there is an H-packing covering X in G.  ... 
doi:10.1137/1.9781611975031.47 dblp:conf/soda/SotoTV18 fatcat:bf5s2o4czjdzzorf4ynphaytt4

Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction

Joonho Lee, Dominic W. Berry, Craig Gidney, William J. Huggins, Jarrod R. McClean, Nathan Wiebe, Ryan Babbush
2021 PRX Quantum  
We also reanalyze and reduce the cost of several of the best prior algorithms for these simulations in order to facilitate a clear comparison to the present work.  ...  In addition to having lower asymptotic scaling space-time volume, compilation of our algorithm for challenging finitesized molecules such as FeMoCo reveals that our method requires the least fault-tolerant  ...  those for the sparse algorithm of Berry et al.  ... 
doi:10.1103/prxquantum.2.030305 fatcat:oa2pd5q2gnbdzm5l5x2r2kej2a

Processing and Notifying Range Top-k Subscriptions

Albert Yu, Pankaj K. Agarwal, Jun Yang
2012 2012 IEEE 28th International Conference on Data Engineering  
techniques for batch updates.  ...  We also present extensions to our solution, including an approximate algorithm that trades off between the cost of server-side reformulation and that of user-side post-processing, as well as efficient  ...  Here, CN-Relax results in far more unnecessary traffic to subscriptions with double-and triple-digit redundancy, compared with less than 0.4 for Paint-Sparse(1) (and 0 for Paint-Sparse because it is exact  ... 
doi:10.1109/icde.2012.67 dblp:conf/icde/YuAY12 fatcat:23d26fnu2rd55d5qd4xzwzrfei

Even more efficient quantum computations of chemistry through tensor hypercontraction [article]

Joonho Lee, Dominic W. Berry, Craig Gidney, William J. Huggins, Jarrod R. McClean, Nathan Wiebe, Ryan Babbush
2020 arXiv   pre-print
We also reanalyze and reduce the cost of several of the best prior algorithms for these simulations in order to facilitate a clear comparison to the present work.  ...  In addition to having lower asymptotic scaling spacetime volume, compilation of our algorithm for challenging finite-sized molecules such as FeMoCo reveals that our method requires the least fault-tolerant  ...  for Strongly Correlated Molecular and Materials Systems" project, funded by the US Department of Energy (DOE).  ... 
arXiv:2011.03494v2 fatcat:bj4g4phepfhajlevnlfweo5s3u

Crowdsourced Quantification and Visualization of Urban Mobility Space Inequality

Michael Szell
2018 Urban Planning  
Using polygon packing and graph algorithms, the platform rearranges all parking and mobility spaces of cars, rails, and bicycles of a city to be directly comparable, making mobility space inequality accessible  ...  We outline how such accessible visualization platforms can facilitate urban planners and policy makers to reclaim road and parking space for pushing forward sustainable transport solutions.  ...  I thank Raphael Reimann for providing the guess data set. I thank Thomas Rooney and Roberta Sinatra for helpful feedback on the manuscript, and Lara Szell for the encouragement.  ... 
doi:10.17645/up.v3i1.1209 fatcat:rfvnxbuatnfrpc5qdrjmcjcdju

Subject Index Volumes 1–200

2001 Discrete Mathematics  
Erdös and Sós, 4925 Erdös and Szekeres, 4879 Erdös et al., 5529, 5888 Erdös Rubin Taylor, 3815 Erdös Sós Turán, 506 Everett, 2901 Faigle and Sands, 2122 Faudree et al., 4399 Faudree Gould Jacobson  ...  Slater, 5299 Hertz and de Werra, 3748 Hibi, 4839 Hoàng, 3748, 4811 Holton, 1660 Holyer and Cockayne, 1118 Howorka, 2636  ...  , see n-separator M-sequence, 2230 m-sequence, see n-sequence m-space, see n-space m-star, see n-star m-system, see n-system m-transversal, see n-transversal , see also balanced ternary design and balanced  ... 
doi:10.1016/s0012-365x(00)00471-4 fatcat:znxg54q6ifgutnhzj3urcw455y

Subject index volumes 1–92

2000 Discrete Applied Mathematics  
, 1076 order, 1680 separation, 1076 spherical separator, 1076 subgraph, 1065 weakly connected digraph, 403 cycle free order, 853 weakly pancyclic graph, 2026 sparse language, 547 triangulated  ...  , 2223 Steiner triple system, 87 I,2042 vertex, 2224 Steiner visibility graph. 1119 Steinhaus graph, 997 Steinitz, 416 exchange property, 4 16 step back, 2182 step-off algorithm, 24 Sterboul  ...  , 373, 640, 2040 reduction, 77,88,219,232,435,481,491,562, 586, 688,736,863,1007 . 1034 ,1115 ,1160 , 1161 , 1387 , 1545 , 1563 , 1745 , 1768 , 1797 , 1988 , 1990 , 1995 ,2 167,22 IO, 2223 algorithm, 711  ... 
doi:10.1016/s0166-218x(00)00208-0 fatcat:3e5dfhyphbbchjttvqq4yalo7e
« Previous Showing results 1 — 15 out of 446 results