Filters








138,498 Hits in 4.1 sec

A major index for matchings and set partitions

William Y.C. Chen, Ira M. Gessel, Catherine H. Yan, Arthur L.B. Yang
2008 Journal of combinatorial theory. Series A  
We introduce a statistic pmaj(P ) for partitions of [n], and show that it is equidistributed with cr 2 , the number of 2-crossings, over all partitions of [n] with given sets of minimal block elements  ...  This generalizes the classical result of equidistribution for the permutation statistics inv and maj.  ...  Acknowledgments The authors thank the anonymous referees for helpful comments and suggestions.  ... 
doi:10.1016/j.jcta.2007.11.003 fatcat:f4grfl4ionef7cum4snaetdhxi

A major index for matchings and set partitions [article]

William Y.C Chen, Ira M. Gessel, Catherine H.Yan, Arthur L.B. Yang
2007 arXiv   pre-print
This generalizes the classical result of equidistribution for the permutation statistics inversion number and major index.  ...  We introduce a statistic on partitions of [n]={1,2,..., n}, and show that it is equidistributed with the number of 2-crossings over partitions of [n] with given sets of minimal block elements and maximal  ...  For example, see [2, 6] for Mahonian statistics for words, [11, 12] for Mahonian statistics and Laguerre polynomials, [10] for a major index statistic for set partitions, and very recently [7]  ... 
arXiv:math/0701096v1 fatcat:22gqm7ajtja5tnbsdejjmjr4cq

Finding Consistent Clusters in Data Partitions [chapter]

Ana Fred
2001 Lecture Notes in Computer Science  
This paper addresses the problem of finding consistent clusters in data partitions, proposing the analysis of the most common associations performed in a majority voting scheme.  ...  Examples, using both simulated and real data, show how this majority voting combination scheme simultaneously handles the problems of selecting the number of clusters, and dependency on initialization.  ...  Evaluation of results on application examples (section 5) makes use of a consistency index between a reference data partition (taken as ideal) and the partitions produced by the methods; a procedure for  ... 
doi:10.1007/3-540-48219-9_31 fatcat:j5linb3bobdnbkw3ogsaduwghi

Combining Fuzzy partitions Using Fuzzy Majority Vote and KNN

Chun sheng Li, Yao nan Wang, Hai dong Yang
2010 Journal of Computers  
a consensus matching algorithm and fuzzy majority vote.  ...  scheme for fuzzy clusterings that fuzzy majority vote, then proposes a cluster matching aims to find a consensus fuzzy partition which optimally algorithm that is able to establish correspondence  ... 
doi:10.4304/jcp.5.5.791-798 fatcat:ic7ykuzk5zcfditit2n5thnriy

PartJoin:An Efficient Storage and Query Execution for Data Warehouses [chapter]

Ladjel Bellatreche, Michel Schneider, Mukesh Mohania, Bharat Bhargava
2002 Lecture Notes in Computer Science  
., data partitioning and indexing.  ...  In this paper, we show that it is beneficial to integrate the data partitioning and indexing (join indexes) techniques for improving the performance of data warehousing queries.  ...  The crucial and the complex problem of this strategy lies in how it efficiently selects a better partitioning schema of a DW modeled by a relational schema and appropriate join indexes for a given set  ... 
doi:10.1007/3-540-46145-0_29 fatcat:vja2cdqrzrbrxdgvyhc6cy2pr4

Long Alternating Paths Exist

Wolfgang Mulzer, Pavel Valtr, Danny Z. Chen, Sergio Cabello
2020 International Symposium on Computational Geometry  
Let P be a set of 2n points in convex position, such that n points are colored red and n points are colored blue.  ...  This is a properly colored matching whose segments are pairwise disjoint and intersected by common line.  ...  Figure 3 3 A set of 18 points and a 3-configuration for it.  ... 
doi:10.4230/lipics.socg.2020.57 dblp:conf/compgeom/MulzerV20 fatcat:5pdx7ifwmvchrczfcvsa6vk2pm

Hierarchical Bitmap Indexing for Range and Membership Queries on Multidimensional Arrays [article]

Luboš Krčál
2021 arXiv   pre-print
The hierarchical indexing method is based on n-di­men­sional sparse trees for dimension partitioning, with bound number of individual, adaptively binned indices for attribute partitioning.  ...  This indexing performs well on range involving both dimensions and attributes, as it prunes the search space early, avoids reading entire index data, and does at most a single index traversal.  ...  Throughout the query processing, we maintain a queue of partially matched nodes P and a set of completely matched nodes C.  ... 
arXiv:2108.13735v1 fatcat:4yehjalvjfh2rocbxasfiil2sa

High performance spatial queries for spatial big data

Fusheng Wang, Ablimit Aji, Hoang Vo
2015 SIGSPATIAL Special  
Our goal is to develop a general framework to support high performance spatial queries and analytics for spatial big data on MapReduce and CPU-GPU hybrid platforms.  ...  There are two major challenges for managing massive spatial data to support spatial queries: the explosion of spatial data, and the high computational complexity of spatial queries.  ...  Acknowledgments This work is supported in part by NSF IIS 1350885, by NSF ACI 1443054, by NLM R01LM009239, and by NCI 1U24CA180924-01A1.  ... 
doi:10.1145/2766196.2766199 fatcat:esmpfrnt6bc35pqcmh2g66jfdm

Long Alternating Paths Exist [article]

Wolfgang Mulzer, Pavel Valtr
2020 arXiv   pre-print
Let P be a set of 2n points in convex position, such that n points are colored red and n points are colored blue.  ...  This is a properly colored matching whose segments are pairwise disjoint and intersected by common line.  ...  We have obtained the first improvement over the simple lower bound bound on the size of a separated monochromatic or bichromatic matching of an additive term that is Ω(n).  ... 
arXiv:2003.13291v1 fatcat:7druoez6ifdvtmskmd3geyf6za

Hierarchical multi-scale supervoxel matching using random forests for automatic semi-dense abdominal image registration

P.-H. Conze, F. Tilquin, V. Noblet, F. Rousseau, F. Heitz, P. Pessaux
2017 2017 IEEE 14th International Symposium on Biomedical Imaging (ISBI 2017)  
Output RF matching probabilities obtained for the last scale are gathered with ancestor matching probabilities which acts as a coarse-to-fine matching guidance.  ...  The effectiveness of our method is highlighted for semi-dense abdominal image registration relying on liver label propagation and consistency assessment.  ...  Single-scale supervoxel matching [5] between I f and I s using random forest [4] applied with SLIC [10] supervoxel indexes as label entities followed by majority voting.  ... 
doi:10.1109/isbi.2017.7950567 dblp:conf/isbi/ConzeTNRHP17 fatcat:onvlzag6vndzxhpzywlcocgzvm

Privacy Preserving String Matching for Cloud Computing

Bruhadeshwar Bezawada, Alex X. Liu, Bargav Jayaraman, Ann L. Wang, Rui Li
2015 2015 IEEE 35th International Conference on Distributed Computing Systems  
We describe an efficient and accurate indexing structure, the PASStree, which can execute a string pattern query in logarithmic time complexity over a set of data items.  ...  But, there are major concerns about the privacy of the data stored on cloud servers.  ...  The second major challenge is, to retrieve the most relevant documents for a given pattern query, because a pattern query can match any sub-string at any location in a keyword and hence, it is essential  ... 
doi:10.1109/icdcs.2015.68 dblp:conf/icdcs/BezawadaLJWL15 fatcat:cxu5zdyjwzhcri3ij2x6ewxesa

Fast Similarity Search for High-Dimensional Dataset

Quan Wang, Suya You
2006 Eighth IEEE International Symposium on Multimedia (ISM'06)  
FFVA is a nearest neighbor search technique that facilitates rapidly indexing and recovering the most similar matches to a highdimensional database of features or spatial data.  ...  This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognition.  ...  It has been shown in [2] and our experiments, that using the hierarchical partitioning and indexing structures for searching beyond a certain dimension becomes even worse than an exhaustive sequential-scan  ... 
doi:10.1109/ism.2006.78 dblp:conf/ism/WangY06 fatcat:aitj4tlzwvb6xnno4tfzo6e3za

Efficient constraint processing for location-aware computing

Zhengdao Xu, Hans-Arno Jacobsen
2005 Proceedings of the 6th international conference on Mobile data management - MEM '05  
In this paper, we state this problem, referring to it as the location constraint matching problem and present and evaluate solutions for solving it.  ...  to be able to identify whether a given set of moving objects is close to each other or close to a given point of demarcation.  ...  ¿From Fig. 7(A) , between the matching load 10% and 20%, the matching time increases along with the matching load for all index schemes and movement patterns.  ... 
doi:10.1145/1071246.1071248 dblp:conf/mdm/XuJ05 fatcat:gowcnsrbmnc5di4ezyev4konta

A Comparison of External Clustering Evaluation Indices in the Context of Imbalanced Data Sets

Marcilio C.P. de Souto, Andre L.V. Coelho, Katti Faceli, Tiemi C. Sakata, Viviane Bonadia, Ivan G. Costa
2012 2012 Brazilian Symposium on Neural Networks  
Some of the metrics are based on matching of sets (F-measure), information theory (normalized mutual information and adjusted mutual information), and pair of objects counting (Rand and adjusted Rand indices  ...  Furthermore, in order to avoid the class size imbalance effect, we propose a modification to the Rand index, referred to as the normalized class size Rand (NCR) index.  ...  ACKNOWLEDGMENTS The authors would like to thank CNPq, CAPES, FACEPE and FAPESP for the financial support provided.  ... 
doi:10.1109/sbrn.2012.25 dblp:conf/sbrn/SoutoCFSBC12 fatcat:shiuvlx4dbgsjdlnqsmb3zrz7m

AMAS: Optimizing the Partition and Filtration of Adaptive Seeds to Speed up Read Mapping

Ngoc Hieu Tran, Xin Chen
2016 IEEE/ACM Transactions on Computational Biology & Bioinformatics  
Specifically, an index is designed to pre-store the locations of adaptive seeds in the reference sequence, efficiently reducing the time for seed matching and partitioning.  ...  However, this task is very time-consuming and majority of mapping tools only focus on one or a few best mapping locations.  ...  Acknowledgements We thank the SeqAn team, especially the authors of Masai package for making their source codes available. Our tool uses the SeqAn library and some well-developed components of Masai.  ... 
doi:10.1109/tcbb.2015.2465900 fatcat:s6q47pnx3nfgpmzpp6kngeb4lu
« Previous Showing results 1 — 15 out of 138,498 results