75,469 Hits in 6.1 sec

An algorithm for calculating top-dimensional bounding chains

J. Frederico Carvalho, Mikael Vejdemo-Johansson, Danica Kragic, Florian T. Pokorny
2018 PeerJ Computer Science  
We describe the Coefficient-Flow algorithm for calculating the bounding chain of an $(n-1)$-boundary on an $n$-manifold-like simplicial complex $S$.  ...  We present an implementation, experimentally evaluate the complexity of our algorithm, and compare its performance with that of solving the underlying linear system.  ...  ., finding the minimal bounding chain w.r.t. some cost function).  ... 
doi:10.7717/peerj-cs.153 pmid:33816807 pmcid:PMC7924431 fatcat:pfvkfdlcojaqvcqks45kmswgb4

Computing minimum area homologies [article]

Erin Wolf Chambers, Mikael Vejdemo-Johansson
2014 arXiv   pre-print
In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any homology (or connected bounding chain) between the two cycles.  ...  However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure.  ...  This means that even without solving for an area minimal bounding chain we are able to establish a confidence interval for the area minimal bounding chain; and unless the local triangulation density varies  ... 
arXiv:1410.2320v1 fatcat:rejc7azptbgifgz7fbnvtcfar4

Recognition of Off-Line Handwritten Devanagari Characters using Combinational Feature Extraction

Deepali R.Birajdar, Manasi M.Patil
2015 International Journal of Computer Applications  
These calculated features are used for further classification. Features which are used here for recognition means histograms of direction chain code of the contour points of the characters [4] .  ...  We are collected features from 64 dimensional feature extraction techniques and shadow features for the Devanagari character recognition in this proposed scheme.  ...  Here in 64 dimensional feature extraction the bounding box of a character is segmented into 16 blocks and chain code histogram is computed in each block.  ... 
doi:10.5120/21204-3883 fatcat:bkw6qemnqbd3npbydhwum4q54u

Integrating Cross-Linking Experiments with Ab Initio Protein–Protein Docking

Thom Vreven, Devin K. Schweppe, Juan D. Chavez, Chad R. Weisbrod, Sayaka Shibata, Chunxiang Zheng, James E. Bruce, Zhiping Weng
2018 Journal of Molecular Biology  
The cross-linking reagent has a maximum length; therefore, the cross-linking data give an upper bound for the geometric distance between paired residues.  ...  For most test cases the rank of the top-scoring near-native prediction was improved by at least two fold compared with docking without the cross-link information, and the success rate for the top 5 predictions  ...  For 3C on the other hand, all nine symmetry-consistent interface pairs symmetrized to an octamer, while the bound structure is hexameric.  ... 
doi:10.1016/j.jmb.2018.04.010 pmid:29665372 pmcid:PMC6084434 fatcat:5ie7meonr5ekvelw4qnlplbgba

On-Line Chain Partitions of Orders: A Survey

Bartłomiej Bosek, Stefan Felsner, Kamil Kloch, Tomasz Krawczyk, Grzegorz Matecki, Piotr Micek
2011 Order  
-The new lower bound for 2-dimensional up-growing orders. General problem Partitioning graphs and orders into simple components is a fundamental combinatorial task.  ...  An on-line algorithm can be understood as an algorithm running without the full knowledge of the input.  ...  Denote by Tops(F i ) the set of maximum elements (tops) of chains from F i . The invariant maintained by Algorithm is the following: Tops(F i ) is an antichain, for every i.  ... 
doi:10.1007/s11083-011-9197-1 fatcat:hxwagkatfjcg7apxla3zfqklqe

Efficient Authentication of Multi-Dimensional Top- $k$ Queries

Xiaoyu Zhu, Jie Wu, Wei Chang, Guojun Wang, Qin Liu
2019 IEEE Access  
We first propose an authentication solution to support multi-dimensional top-k query based on signature chain.  ...  By using signature chain for each record and its successors on each dimension, our solution allows users to efficiently verify the soundness and completeness of the multi-dimensional top-k query results  ...  Algorithm 1 Two-Dimensional Top-k Query Input: Query Q = {Score(r), k}, dataset D.  ... 
doi:10.1109/access.2018.2888564 fatcat:jfebfefzwreylajzrqnd5oh6rm

Offline Tamil Handwritten Character Recognition Using Sub Line Direction and Bounding Box Techniques

S. M. Shyni, M. Antony Robert Raj, S. Abirami
2015 Indian Journal of Science and Technology  
Zoning and Chain Code procedures are employed here to select the features and Sub Line Direction and Bounding box algorithms are used for extracting the features.  ...  Character recognition plays an important role in the field of pattern recognition.  ...  (X i ) + B) <… ………. (3) where, Yi=1 or -1 and the a1, a2 … aN are the threshold values. W is the Weight factor calculated from Legrangian Theorem and B is the bias value.  ... 
doi:10.17485/ijst/2015/v8is7/67780 fatcat:hrrr6zpu7jf6rclgt73if5ypwu

Top-k Queries Over Uncertain Scores [chapter]

Qing Liu, Debabrota Basu, Talel Abdessalem, Stéphane Bressan
2016 Lecture Notes in Computer Science  
In this paper, we explore the design space of Metropolis-Hastings Markov chain Monte Carlo algorithms for answering probabilistic top-k queries over a database of objects with uncertain scores.  ...  Several data models for uncertain data and several semantics for probabilistic top-k queries have been proposed in the literature.  ...  This research is funded by research grant R-252-000-622-114 by Singapore Ministry of Education Academic Research Fund (project 251RES1607-"Janus: Effective, Efficient and Fair Algorithms for Spatio-temporal  ... 
doi:10.1007/978-3-319-48472-3_14 fatcat:epldquofcng7vlzpcy4fwfluce

Hybrid infinite time-evolving block decimation algorithm for long-range multi-dimensional quantum many-body systems [article]

Tomohiro Hashizume, Jad C. Halimeh, Ian P. McCulloch
2019 arXiv   pre-print
We present an algorithm based on a hybrid extension of iTEBD where finite blocks of a chain are first locally time-evolved before an iTEBD-like method combines these processes globally.  ...  In recent years, the infinite time-evolution block decimation (iTEBD) method has been demonstrated to be one of the most efficient and powerful numerical schemes for time-evolution in one-dimensional quantum  ...  The first involves local time evolution of several sites on the 1D chain using an algorithm for time-evolving a finite system.  ... 
arXiv:1910.10726v1 fatcat:mmdz7nciq5bvpcpjeayyfhbjve

Near-Optimal Algorithms for Differentially-Private Principal Components [article]

Kamalika Chaudhuri, Anand D. Sarwate, Kaushik Sinha
2013 arXiv   pre-print
Principal components analysis (PCA) is a standard tool for identifying good low-dimensional approximations to data in high dimension.  ...  Algorithms which operate on such data should be sensitive to the privacy risks in publishing their outputs.  ...  Acknowledgements KC and KS would like to thank NIH for research support under U54-HL108460.  ... 
arXiv:1207.2812v3 fatcat:y26kyvki45auzh7ku346prfrhi

Integrating cross-linking experiments with ab initio protein-protein docking [article]

Thom Vreven, Devin K Schweppe, Juan D Chavez, Chad R Weisbrod, Sayaka Shibata, Chunxiang Zheng, James E Bruce, Zhiping Weng
2018 bioRxiv   pre-print
For most test cases the rank of the top-scoring near-native prediction was improved by at least two fold compared with docking without the cross-link information, and the success rates for the top 5 and  ...  Several test cases had multiple components with distinct interfaces, and we present an approach for assigning cross-links to the interfaces.  ...  When the bound structure had multiple interfaces, we calculated the iRMSD for each interface separately and used the lowest value.  ... 
doi:10.1101/275891 fatcat:giwt7ixvefdxngfqyhvvvpww3e

Multidimensional mSUGRA likelihood maps

B. C. Allanach, C. G. Lester
2006 Physical Review D  
Simultaneous variations of m_0, A_0, M_1/2, tan beta, m_t, m_b and alpha_s(M_Z) are applied using a Markov chain Monte Carlo algorithm.  ...  We calculate the likelihood map in the full 7 dimensional parameter space of the minimal supersymmetric standard model (MSSM) assuming universal boundary conditions on the supersymmetry breaking terms.  ...  Acknowledgments We would like to thank other members of the Cambridge SUSY Working Group, W de Boer, P Gondolo, P Häfliger, B Heinemann, S Heinemeyer, G Manca, A Peel and T Plehn for helpful conversations  ... 
doi:10.1103/physrevd.73.015013 fatcat:5t7onddsqvalnguzd537nsuegi

Top- vectorial aggregation queries in a distributed environment

Guy Sagy, Izchak Sharfman, Daniel Keren, Assaf Schuster
2011 Journal of Parallel and Distributed Computing  
Our communication-efficient algorithm uses a blend of geometric and skyline related machinery, some of which is newly developed, as well as an algorithmic framework for defining generic local constraints  ...  However, in many important setups each node might hold instead a full d-dimensional vector of numerical attributes for each object.  ...  An interesting set of top-k queries are those where the local scores are d-dimensional vectors, and the scoring function is applied over the aggregation of these vectors. For example: Example 1.  ... 
doi:10.1016/j.jpdc.2010.09.002 fatcat:z7eyzj7dkfajlbi5wnpogzweyq

Fast detection of polyhedral intersection

David P. Dobkin, David G. Kirkpatrick
1983 Theoretical Computer Science  
Methods are given for unifyin:: and extending previous work on detecting intersections of suitably preprocessed polyhedra.  ...  New upper bounds of O(log n) and O\log* IZ I are given on plane-polyhedron and polyhedron-polyhedron intersection problems.  ...  WC thank an anonymous rcfcrtx for comments leading to a more coherent final presentation. References  ... 
doi:10.1016/0304-3975(82)90120-7 fatcat:j6w24u2vovdlpih42fo4s7g6lu

Stochastic methods for model assessment of airborne frequency-domain electromagnetic data

Burke J. Minsley, James Irving, Jared D. Abraham, Bruce D. Smith
2012 ASEG Extended Abstracts  
The Nebraska Environmental Trust Fund and the North and South Platte Natural Resource Districts provided support for this work.  ...  ACKNOWLEDGMENTS Funding for this work was provided by the U.S. Geological Survey Mineral Resources Program, though the Integrated Methods Development Project led by Jeff Phillips.  ...  Figure 1 shows a general flowchart for the trans-dimensional MCMC algorithm for 1D soundings.  ... 
doi:10.1071/aseg2012ab245 fatcat:62aoepujwneptm7i4ohspa3nai
« Previous Showing results 1 — 15 out of 75,469 results