Filters








2,180 Hits in 6.0 sec

A Novel Approach for Affine Point Pattern Matching [chapter]

H. Suesse, W. Ortmann, K. Voss
2006 Lecture Notes in Computer Science  
In this paper, we present a new approach to the APPM problem based on matching in bipartite graphs.  ...  Affine point pattern matching (APPM) is an integral part of many pattern recognition problems.  ...  Now we have the assignment problem of finding a perfect minimum cost weighted matching in bipartite graphs.  ... 
doi:10.1007/11867661_39 fatcat:q63k2ytwlbevhirnhwep6gcom4

A Predictive Fleet Management Strategy for On-Demand Mobility Services: A Case Study in Munich

Michael Wittmann, Lorenz Neuner, Markus Lienkamp
2020 Electronics  
In addition, the results indicated that the reduced fleet size of the predictive strategy was still 20% larger compared to the theoretical optimum resulting from a bipartite matching approach.  ...  This paper examines the potential of predictive fleet management strategies applied to a large-scale real-world taxi dataset for the city of Munich.  ...  This optimization strategy is familiar from the literature as the minimum cost maximum bipartite matching technique [20, 21, 29] .  ... 
doi:10.3390/electronics9061021 fatcat:lnr5mwg6nfhrxcdeqt57nax3ni

Diverse Weighted Bipartite b-Matching

Faez Ahmed, John P. Dickerson, Mark Fuge
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
Bipartite matching, where agents on one side of a market are matched to agents or items on the other, is a classical problem in computer science and economics, with widespread application in healthcare  ...  ---in a generalization of bipartite matching where agents on one side of the market can be matched to sets of agents on the other.  ...  This paper addresses how to compute diverse matchings under various constraints, bounds the loss on economic efficiency due to using a diverse matching, and shows in simulation and on data from three real-world  ... 
doi:10.24963/ijcai.2017/6 dblp:conf/ijcai/AhmedDF17 fatcat:ioao6luaoncjxilqilkac45e5i

Capacity constrained assignment in spatial databases

Leong Hou U, Man Lung Yiu, Kyriakos Mouratidis, Nikos Mamoulis
2008 Proceedings of the 2008 ACM SIGMOD international conference on Management of data - SIGMOD '08  
., suboptimal) CCA solutions that provide a trade-off between result accuracy and computation cost, abiding by theoretical quality guarantees.  ...  Although max-flow algorithms are applicable to this problem, they require the complete distance-based bipartite graph between Q and P .  ...  Assignment Cost Guarantee Let M be the matching computed by SA and MCCA be the optimal matching.  ... 
doi:10.1145/1376616.1376621 dblp:conf/sigmod/UYMM08 fatcat:ykgub2ol7vbkdhlsl2rqd4seiy

Assessing Optimal Assignment under Uncertainty: An Interval-based Algorithm

L. Liu, D. Shell
2010 Robotics: Science and Systems VI  
We introduce a new O(n 4 ) algorithm, the Interval Hungarian algorithm, that extends the classic Kuhn-Munkres Hungarian algorithm to compute the maximum interval of deviation (for each entry in the assignment  ...  matrix) which will retain the same optimal assignment.  ...  The Hungarian Algorithm (Algorithm II.1) searches for a perfect matching in a sub-graph of the complete bipartite graph, where the perfect matching is exactly the optimal assignment solution.  ... 
doi:10.15607/rss.2010.vi.016 dblp:conf/rss/LiuS10 fatcat:wnk5r6ec2zecvp5jtufwpvn43u

Assessing optimal assignment under uncertainty: An interval-based algorithm

Lantao Liu, Dylan A Shell
2011 The international journal of robotics research  
We introduce a new O(n 4 ) algorithm, the Interval Hungarian algorithm, that extends the classic Kuhn-Munkres Hungarian algorithm to compute the maximum interval of deviation (for each entry in the assignment  ...  matrix) which will retain the same optimal assignment.  ...  The Hungarian Algorithm (Algorithm II.1) searches for a perfect matching in a sub-graph of the complete bipartite graph, where the perfect matching is exactly the optimal assignment solution.  ... 
doi:10.1177/0278364911404579 fatcat:3zhpdddegzejhm4kjmdqbgk2pu

A Server-Assigned Spatial Crowdsourcing Framework

Hien To, Cyrus Shahabi, Leyla Kazemi
2015 ACM Transactions on Spatial Algorithms and Systems  
Extensive experiments with various synthetic and two real-world datasets show the applicability of our proposed framework.  ...  We propose alternative solutions to address these challenges by exploiting the spatial properties of the problem space, including the spatial distribution and the travel cost of the workers.  ...  By computing the travel cost of every match <w, t>, we can associate to every pair the corresponding cost.  ... 
doi:10.1145/2729713 fatcat:nmziodofhrapnezqtarkniww2e

Scalable, Distributed, Real-Time Map Generation

J.J. Davies, A.R. Beresford, A. Hopper
2006 IEEE pervasive computing  
minimum-cost maximal matching on the bipartite graph.  ...  A minimum-cost maximal matching on this bipartite graph will therefore indicate which edges in the old and present versions best correspond and will 50 PERVASIVE computing www.computer.org/pervasive  ... 
doi:10.1109/mprv.2006.83 fatcat:zamq6ispozcydcxapz7rrbdmfe

Preference-driven similarity join

Chuancong Gao, Jiannan Wang, Jian Pei, Rui Li, Yi Chang
2017 Proceedings of the International Conference on Web Intelligence - WI '17  
Our approaches are evaluated on four real-world web datasets from a diverse range of application scenarios.  ...  Once a preference is chosen, we automatically compute the similarity join result optimizing the preference objective.  ...  In Section 5, we evaluate our approach on four real-world web datasets from a diverse range of applications.  ... 
doi:10.1145/3106426.3106484 dblp:conf/webi/GaoWPLC17 fatcat:od3hz4iiynbq5jw23dqrp2mm7a

Sampling for Approximate Bipartite Network Projection [article]

Nesreen K. Ahmed and Nick Duffield and Liangzhen Xia
2018 arXiv   pre-print
Experiments on real world graphs show that a 10 edges with weighted relative errors of about 1  ...  Bipartite networks manifest as a stream of edges that represent transactions, e.g., purchases by retail customers.  ...  We argue that the observed properties of neighborhood based similarity scores in real-world graph data provide an opportunity for space and computational savings by sampling, while providing score estimates  ... 
arXiv:1712.08685v2 fatcat:4s47irhoeje4dnwog44oxkvbti

TimeCrunch

Neil Shah, Danai Koutra, Tianmin Zou, Brian Gallagher, Christos Faloutsos
2015 Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '15  
Which patterns exist in real-world dynamic graphs, and how can we find and rank them in terms of importance? These are exactly the problems we focus on in this work.  ...  In practice, these deviations indicate patterns -for example, botnet attackers forming a bipartite core with their victims over the duration of an attack, family members bonding in a clique-like fashion  ...  temporal signatures which we anticipate to find in real-world dynamic graphs [4] : oneshot (o), ranged (r), periodic (p), flickering (f ) and constant (c), and 6 very common structures found in real-world  ... 
doi:10.1145/2783258.2783321 dblp:conf/kdd/ShahKZGF15 fatcat:efsdfautynbspdsfqcrargowri

A Study of Performance of Optimal Transport [article]

Yihe Dong, Yu Gao, Richard Peng, Ilya Razenshteyn, Saurabh Sawlani
2020 arXiv   pre-print
We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph.  ...  We compare runtimes in computing OT distances on data from several domains, such as synthetic data of geometric shapes, embeddings of tokens in documents, and pixels in images.  ...  This loss in the objective is negligible compared to the total transport cost in most real world datasets. Combinatorial Optimal Transport Variations of the Hungarian algorithm.  ... 
arXiv:2005.01182v1 fatcat:lybrsjq3lfh2rdqx62ia3gpkqm

DTD-Diff: A Change Detection Algorithm for DTDs [chapter]

Erwin Leonardi, Tran T. Hoai, Sourav S. Bhowmick, Sanjay Madria
2006 Lecture Notes in Computer Science  
The DTD of a set of XML documents may change due to many reasons such as changes to the real world events, changes to the user's requirements, and mistakes in the initial design.  ...  Such change detection tool can be useful in several ways such as maintenance of XML documents, incremental maintenance of relational schema for storing XML data, and XML schema integration.  ...  We also study the performance of DTD-Diff and X-Diff by using real world DTDs [2, 4] . Figure 6 (d) depicts the characteristics of the real world DTDs. We set the percentage of changes to 3%.  ... 
doi:10.1007/11733836_59 fatcat:3luxbyob2jha3ngcwij2d3ugxm

DTD-Diff: A change detection algorithm for DTDs

Erwin Leonardi, Tran T. Hoai, Sourav S. Bhowmick, Sanjay Madria
2007 Data & Knowledge Engineering  
The DTD of a set of XML documents may change due to many reasons such as changes to the real world events, changes to the user's requirements, and mistakes in the initial design.  ...  Such change detection tool can be useful in several ways such as maintenance of XML documents, incremental maintenance of relational schema for storing XML data, and XML schema integration.  ...  We also study the performance of DTD-Diff and X-Diff by using real world DTDs [2, 4] . Figure 6 (d) depicts the characteristics of the real world DTDs. We set the percentage of changes to 3%.  ... 
doi:10.1016/j.datak.2006.06.003 fatcat:gboz4qugx5efldvibcmjkdwzhq

Principled Graph Matching Algorithms for Integrating Multiple Data Sources [article]

Duo Zhang and Benjamin I. P. Rubinstein and Jim Gemmell
2014 arXiv   pre-print
record linkage communities accomplish such matchings in the final stage by weighted bipartite graph matching on similarity scores.  ...  In addition to a theoretical guarantee on the latter, we present comparisons on a real-world ER problem from Bing significantly larger than typically found in the literature, publication data, and on a  ...  Our movie dataset aims to demonstrate the performance of our algorithms in a real, very large-scale application; the publication dataset adds further support to our conclusions on additional real-world  ... 
arXiv:1402.0282v1 fatcat:ug3go42r7nhjneojy3xmcyojfq
« Previous Showing results 1 — 15 out of 2,180 results