7,148 Hits in 5.6 sec

Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems [article]

Jiří Fiala and Tomáš Gavenčiak and Dušan Knop and Martin Koutecký and Jan Kratochvíl
2015 arXiv   pre-print
We rephrase the distance constrained graph labeling problem as a specific uniform variant of the Channel Assignment problem and show that this problem is fixed parameter tractable when parameterized by  ...  We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view.  ...  The Channel Assignment problem is FPT when parameterized by w max and the size of vertex cover.  ... 
arXiv:1507.00640v2 fatcat:2xlaquhqxbfc5gedz5hqjc4v6e

On the Complexity of Connectivity in Cognitive Radio Networks Through Spectrum Assignment [article]

Hongyu Liang and Tiancheng Lou and Haisheng Tan and Yuexuan Wang and Dongxiao Yu
2013 arXiv   pre-print
In this paper, we initiate the first systematic study on the algorithmic complexity of the connectivity problem in CRNs through spectrum assignments.  ...  For the special case where the number of channels is constant and all the SUs have the same number of antennae, which is more than one but less than the number of channels, the problem is also NP-complete  ...  In fact, we prove a stronger result saying that the problem is fixed parameter tractable when parameterized by the number of channels. (See [5] for notations in parameterized complexity.)  ... 
arXiv:1301.0995v1 fatcat:obz7xuzpmfguroegwd36wqy75q

Distancecut: Interactive Segmentation and Matting of Images and Videos

Xue Bai, Guillermo Sapiro
2007 2007 IEEE International Conference on Image Processing  
These weighted distances assign probabilities to each labeled class for every pixel.  ...  The segmentation and alpha matte are obtained from the fast, linear complexity, computation of weighted distances to the user-provided scribbles.  ...  Then, the distance from a pixel t to a single label li, i ∈ [1, N l ], is di(t) = min s∈Ωc : label(s)=l i d(s, t), and the probability P (t ∈ li) for t to be assigned to the label li representing the class  ... 
doi:10.1109/icip.2007.4379139 dblp:conf/icip/BaiS07 fatcat:45d637jtszaibhuayyylzdf4ye

Computing Capacity and Connectivity in Cognitive Radio Ad-Hoc Networks

Qiang-Sheng Hua, Haisheng Tan, Yuexuan Wang, Hongxing Li, Dongxiao Yu, Francis C.M. Lau, Chuan Wu
2012 2012 12th International Symposium on Pervasive Systems, Algorithms and Networks  
We first briefly survey these challenges and their potential impact on the design of efficient algorithms for several fundamental problems in CRAHNs.  ...  By assuming the physical interference model and asynchronous communications, we reformulate the above two problems where the capacity maximization problem is to find the maximum number of simultaneously  ...  THE COMPLEXITY OF CONNECTIVITY In this section, we consider the connectivity problem of multiple links through channel assignment.  ... 
doi:10.1109/i-span.2012.8 fatcat:o26ld2s5h5bsjptnusm7ysefqe

Assessing alternative methods for unsupervised segmentation of urban vegetation in very high-resolution multispectral aerial imagery

Allison Lassiter, Mayank Darbari, Tayyab Ikram Shah
2020 PLoS ONE  
Existing and emerging public datasets with the spatial resolution necessary to identify granular urban vegetation lack a depth of affordable and accessible labeled training data, making unsupervised segmentation  ...  Though we find the unsupervised CNN shows high degrees of accuracy on built urban landscape features, its accuracy when segmenting vegetation does not justify its complexity.  ...  Acknowledgments We thank Anthony Vodacek and one anonymous reviewer for their valuable comments on this paper. We also thank John Radke and Dana Tomlin for insightful feedback on earlier drafts.  ... 
doi:10.1371/journal.pone.0230856 pmid:32379776 fatcat:6a7bpsls7vdcjbq6psnwdvh4ra

A hybrid model-based and learning-based approach for classification using limited number of training samples [article]

Alireza Nooraiepour, Waheed U. Bajwa, Narayan B. Mandayam
2021 arXiv   pre-print
Specifically, in order to address the mismatch problem, the classifier learns a mapping from the training data and the synthetic data to a common feature space.  ...  The standalone learning-based and statistical model-based classifiers face major challenges towards the fulfillment of the classification task using a small training set.  ...  For instance, for the problem of channel spoofing detection, a hypothesis test is proposed in [5] that assigns labels to unlabeled samples based on their similarity, measured in terms of the Euclidean  ... 
arXiv:2106.13436v2 fatcat:hrtwy4frbnaubjocazw6mqkd5i

On the complexity of some colorful problems parameterized by treewidth

Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2011 Information and Computation  
In this paper we study the complexity of several coloring problems on graphs, parameterized by the treewidth of the graph. 1.  ...  The LIST COLORING problem takes as input a graph G, together with an assignment to each vertex v of a set of colors C v .  ...  The first author also acknowledges the support provided by a Fellowship to the Institute of Advanced Studies, Durham University, and the support of the Informatics Institute at the University of Bergen  ... 
doi:10.1016/j.ic.2010.11.026 fatcat:sfyj6cofungeplh5riskcy6s5u

Contention Resolution with Predictions [article]

Seth Gilbert, Calvin Newport, Nitin Vaidya, Alex Weaver
2021 arXiv   pre-print
Using a novel connection between contention resolution and information theory, we prove lower bounds on the expected time complexity with respect to the Shannon entropy of the corresponding network size  ...  The goal is to leverage the predictive power of this distribution to improve on worst-case time complexity bounds.  ...  The range finding problem is parameterized with a network size and range expressed as a function ( ) of this size.  ... 
arXiv:2105.12706v1 fatcat:65xr2mhnnrg3lh3pmfcyhywuxq

Binary-Tree Encoding for Uniform Binary Sources in Index Modulation Systems [article]

Justin P. Coon, Mihai-Alin Badiu, Ye Liu, Ferhat Yarkin, Shuping Dang
2019 arXiv   pre-print
Under this constraint, we undertake the task of maximizing the achievable rate subject to the availability of channel knowledge at the transmitter.  ...  Numerical analysis shows that this approach is capable of achieving the maximum mutual information for the relaxed problem in low and high-SNR regimes and offers noticeable benefits in terms of achievable  ...  Hachem Yassine and Mr. Jinchuan Tang for their helpful suggestions regarding the proof of Proposition 3 and the structuring of numerical simulations.  ... 
arXiv:1901.01736v1 fatcat:kqstv65xczccpdv6licqhpmq7a

Anatomical Identification of Extracellularly Recorded Cells in Large-Scale Multielectrode Recordings

P. H. Li, J. L. Gauthier, M. Schiff, A. Sher, D. Ahn, G. D. Field, M. Greschner, E. M. Callaway, A. M. Litke, E. J. Chichilnisky
2015 Journal of Neuroscience  
This study combines for the first time two major approaches to understanding the function and structure of neural circuits: large-scale multielectrode recordings, and confocal imaging of labeled neurons  ...  To achieve this end, we develop a novel approach to the central problem of anatomically identifying recorded cells, based on the electrical image: the spatiotemporal pattern of voltage deflections induced  ...  ϭ 87,178,291,200 total) of this linear assignment problem (Burkard et al., 2009 ) was generated iteratively in lexicographic order and for each permutation two distance-based cost metrics were calculated  ... 
doi:10.1523/jneurosci.3675-14.2015 pmid:25788683 pmcid:PMC4363392 fatcat:mojk55ijenbsvnyxpctau3tqfq

Indirection mapping for quasi-conformal relief texturing

Morgan McGuire, Kyle Whitson
2008 Proceedings of the 2008 symposium on Interactive 3D graphics and games - SI3D '08  
Because it is independent of the resolution of the base geometry, indirection mapping can be used with POM, heightfields, and any other displacement effect.  ...  We pre-warp structured textures by the inverse of the indirection map to maintain their appearance. Our process gives approximately uniform texture resolution on all surfaces.  ...  Acknowledgments We thank NVIDIA for donating the rendering hardware, Mihai Stoiciu for explaining the complex analysis implications, Sara Carian for proofreading, and the anonymous reviewers for their  ... 
doi:10.1145/1342250.1342280 dblp:conf/si3d/McGuireW08 fatcat:rhqd7pe64fazhni3ilz45aq7iu

8th International Colloquium on Automata, Languages and Programming (ICALP 81)

1981 IEEE Transactions on Software Engineering  
"Uniformization problems for synchronizations of automatic relations on words".  ...  and Metric Labelling Problems Felix Reidl and Magnus Wahlström . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 94:1-94:14 An Operational Characterization of  ... 
doi:10.1109/tse.1981.234528 fatcat:ob65j2ybgzbgba6y6ar7bczb6a

Stochastic Erasure-Only List Decoding Algorithms for Reed-Solomon Codes

Chang-Ming Lee, Yu.T. Su
2009 IEEE Signal Processing Letters  
The proposed algorithms offer both complexity and performance advantages over some existing algebraic decoding algorithms for high rate RS codes.  ...  To increase the search radius and enhance the decoder performance we use the randomly drawn samples to generate what we call virtual received words from which extra candidate codewords and thus candidate  ...  Furthermore, (b) is equivalent to the following minimization problem (6) where is defined by (1) and is the Euclidean distance (ED) between the -ary real vectors and . B.  ... 
doi:10.1109/lsp.2009.2022792 fatcat:anas2j4bwrf2rfafezjophhqlm

Graph Layout Problems Parameterized by Vertex Cover [chapter]

Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh
2008 Lecture Notes in Computer Science  
In the framework of parameterized complexity, one of the most commonly used structural parameters is the treewidth of the input graph.  ...  In this paper we study graph layout problems parameterized by the size of the minimum vertex cover of the input graph. We show that all the mentioned problems are fixed parameter tractable.  ...  Introduction Parameterized complexity can be thought of as a "multivariate" approach to complexity analysis and algorithm design.  ... 
doi:10.1007/978-3-540-92182-0_28 fatcat:r26jot7l35evzeji3tuvygq3na

A Coding Theory Perspective on Multiplexed Molecular Profiling of Biological Tissues [article]

Luca D'Alessio, Litian Liu, Ken Duffy, Yonina C. Eldar, Muriel Medard, Mehrtash Babadi
2021 arXiv   pre-print
We propose a more appropriate asymmetric channel model that can be readily parameterized from data and use it to develop a maximum a posteriori (MAP) decoders.  ...  Core to that technology is a coding problem: with each RNA sequence of interest being a codeword, how to design a codebook of probes, and how to decode the resulting noisy measurements?  ...  labels shown in the sub-panels indicate hybridization rounds {1, . . . , 8} and color channels {1, 2}.  ... 
arXiv:2101.11123v2 fatcat:4nb5s2xmtjcqnbtdrg3simxfra
« Previous Showing results 1 — 15 out of 7,148 results