Filters








2,143 Hits in 4.3 sec

Faster Counting and Sampling Algorithms using Colorful Decision Oracle [article]

Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra
2022 arXiv   pre-print
[SODA '20] established that decision vs counting complexities of a number of combinatorial optimization problems can be abstracted out as d-Hyperedge Estimation problems with a CID oracle access.  ...  The oracle access to the hypergraph is called Colorful Independence Oracle (CID), which takes d (non-empty) pairwise disjoint subsets of vertices A_1,...  ...  [SODA '20] established that decision vs counting complexities of a number of combinatorial optimization problems can be abstracted out as d-Hyperedge Estimation problems with a CID oracle access.  ... 
arXiv:2201.04975v2 fatcat:spsgzu2oeje2xoahowibxooasq

Faster Counting and Sampling Algorithms Using Colorful Decision Oracle

Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Petra Berenbrink, Benjamin Monmege
2022
Hyperedge Estimation & Sampling using Colorful Independence Oracle (CID). We give an improvement over the bounds obtained by Dell et al. [SODA '21].  ...  [SODA '20] established that decision vs counting complexities of a number of combinatorial optimization problems can be abstracted out as d-Hyperedge Estimation problems with a CID oracle access.  ...  Lemma 5.1), by a careful analysis of the intersection pattern of the hypergraphs and setting the sampling probability parameters in Verify Estimate (Algorithm 1) algorithm in a nontrivial way, which is  ... 
doi:10.4230/lipics.stacs.2022.10 fatcat:pjukld5nwnbi5nfvdl2s33p7tm

Data-parallel Micropolygon Rasterization [article]

Christian Eisenacher, Charles Loop
2010 Eurographics State of the Art Reports  
We implement a tile based sort-middle rasterizer in CUDA and study its performance characteristics when used as a backend for adaptive tessellation down to micropolygons.  ...  characteristics when used as a backend for adaptive tessellation down to micropolygons.  ...  Acknowledgements: We want to thank the anonymous reviewers for their work and detailed feedback, as well as Bay Raitt of Valve Software for the big guy model.  ... 
doi:10.2312/egsh.20101046 fatcat:f3nowpnosjhw7giqq3uiqhtr64

Inverse Problems, Constraint Satisfaction, Reversible Logic, Invertible Logic and Grover Quantum Oracles for Practical Problems [chapter]

Marek Perkowski
2020 Lecture Notes in Computer Science  
It is well-known that the "Unsorted Database" quantum algorithm by Grover gives quadratic speedup to several important combinatorial and enumerative problems, such as: SAT, Graph Coloring, Maximum Cliques  ...  Recently, quantum programming languages such as Quipper start to be used to design, verify and simulate practical quantum algorithms for important problems in Quantum Machine Learning.  ...  Figure 2 shows the beginning of the sample count sequence generated by the Counter to be used by the Multiplexers inside the Selector block.  ... 
doi:10.1007/978-3-030-52482-1_1 fatcat:xw3kgmienzhh7mmfi4u3n6h7d4

Pattern detection in large temporal graphs using algebraic fingerprints [chapter]

Suhas Thejaswi, Aristides Gionis
2020 Proceedings of the 2020 SIAM International Conference on Data Mining  
In particular, given a vertex-colored temporal graph and a multi-set of colors as a query, we search for temporal paths in the graph that contain the colors specified in the query.  ...  For example, in a real-world graph dataset with more than six million edges and a multi-set query with ten colors, we can extract an optimal solution in less than eight minutes on a haswell desktop with  ...  [12] used the decision oracles introduced by Björklund et al. to approximately count the motifs.  ... 
doi:10.1137/1.9781611976236.5 dblp:conf/sdm/ThejaswiG20 fatcat:tbljv2j56jb3riym674xncjxlu

A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry [article]

Pascal Schweitzer
2017 arXiv   pre-print
The paper develops a new technique to extract a characteristic subset from a random source that repeatedly samples from a set of elements.  ...  With this technique at hand the paper looks at the special case of the tournament isomorphism problem that stands in the way towards a polynomial-time algorithm for the graph isomorphism problem.  ...  Algorithm 1 An invariant automorphism sampler for tournaments using an asymmetry oracle Input: A tournament T that is not asymmetric and an oracle O for tournament asymmetry.  ... 
arXiv:1704.08529v1 fatcat:hf4tyh5w5rckdd7c5gbcci3tri

Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH [article]

Shuichi Hirahara, Nobutaka Shimizu
2020 arXiv   pre-print
Specifically, we consider the K_a,b counting problem in a random bipartite graph, where K_a,b is a complete bipartite graph for constants a and b.  ...  We proved that the K_a,b counting problem admits an n^a+o(1)-time algorithm if a≥ 8, while any n^a-ϵ-time algorithm fails to solve it even on random bipartite graph for any constant ϵ>0 under the Strong  ...  ., small treewidth), several faster algorithms are known (see [Cur18] and the references therein).  ... 
arXiv:2010.05822v1 fatcat:zp5fqu4ro5abzethr3bvjwy4jy

CASHT: Contention Analysis in Shared Hierarchies with Thefts

Cesar Gomes, Maziar Amiraski, Mark Hempstead
2022 ACM Transactions on Architecture and Code Optimization (TACO)  
CASHT employs a novel run-time framework for collecting thefts-based metrics despite partition intervention, and enables per-access sampling rather than set sampling that could add overhead but may not  ...  Coupling CASHT and GBT for use as a dynamic policy results in a very lightweight and dynamic partitioning scheme that performs within a margin of error of Utility-based Cache Partitioning at a 1/8 the  ...  The GBT model we train achieves 90% pseudo oracle prediction accuracy at 100 B and 95+% accuracy at 1 k+B, and the Tree-scaling algorithm allows us to scale our solution above two-core architectures.  ... 
doi:10.1145/3494538 fatcat:7hdjfrgf2bg6fhlill7tn553py

An Ensemble Color Model for Human Re-identification

Xiaokai Liu, Hongyu Wang, Yi Wu, Jimei Yang, Ming-Hsuan Yang
2015 2015 IEEE Winter Conference on Applications of Computer Vision  
In this paper, we propose a novel ensemble model that combines different color descriptors in the decision level through metric learning.  ...  Experiments show that the proposed system significantly outperforms state-of-the-art algorithms on two challenging datasets (VIPeR and PRID 450S).  ...  In this paper, the RGB, HSV and Lab models are used in the proposed algorithm. Invariant color features.  ... 
doi:10.1109/wacv.2015.120 dblp:conf/wacv/LiuWWYY15 fatcat:o73fojsxrzhyrkfr7dvel4myr4

Fairness in Streaming Submodular Maximization: Algorithms and Hardness [article]

Marwa El Halabi, Slobodan Mitrović, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski
2020 arXiv   pre-print
To this end, we develop the first streaming approximation algorithms for submodular maximization under fairness constraints, for both monotone and non-monotone functions.  ...  Submodular maximization has become established as the method of choice for the task of selecting representative and diverse summaries of data.  ...  Acknowledgments and Disclosure of Funding  ... 
arXiv:2010.07431v2 fatcat:tzmdn4rnljcepa3nuew7m476tq

Real-time view-dependent rendering of parametric surfaces

Christian Eisenacher, Quirin Meyer, Charles Loop
2009 Proceedings of the 2009 symposium on Interactive 3D graphics and games - I3D '09  
The overall algorithm is simple, fits current GPUs extremely well, and is surprisingly fast while producing little to no artifacts.  ...  Our framework allows us to bound the screen space error of a piecewise linear approximation.  ...  We also want to thank the anonymous reviewers for their work and detailed feedback, as well as Bay Raitt of Valve Software for the big guy and sports car models.  ... 
doi:10.1145/1507149.1507172 dblp:conf/si3d/EisenacherML09 fatcat:tawexmuh7rah3dmvaibsg3zcwy

DECAL: DEployable Clinical Active Learning [article]

Yash-yee Logan, Mohit Prabhushankar, Ghassan AlRegib
2022 arXiv   pre-print
Our active learning results were achieved using 3000 (5%) and 2000 (38%) samples of OCT and X-Ray data respectively.  ...  Our approach is a "plug-in" method that makes natural image based active learning algorithms generalize better and faster.  ...  We use 1349 healthy, 1345 viral and 2538 bacterial samples in the combined training and oracle sets from 2650 unique patients.  ... 
arXiv:2206.10120v2 fatcat:lmhint7jy5bwdou53vnebs7dbm

Top-K oracle: A new way to present top-k tuples for uncertain data

Chunyao Song, Zheng Li, Tingjian Ge
2013 2013 IEEE 29th International Conference on Data Engineering (ICDE)  
We devise various query processing algorithms for top-k oracles, and verify their efficiency and accuracy through a systematic evaluation over real-world and synthetic datasets.  ...  Instead of returning users tuples, which are merely one point in the complex distribution of top-k tuple vectors, we provide a so-called top-k oracle and users can arbitrarily query it.  ...  IV, we will also empirically show that our algorithm is much faster (about seven times faster with a real-world dataset). B.  ... 
doi:10.1109/icde.2013.6544821 dblp:conf/icde/SongLG13 fatcat:2keucil42nbkpi4bmuo2wc7s7u

Amplitude Amplification for Optimization via Subdivided Phase Oracle [article]

Naphan Benchasattabuse, Takahiko Satoh, Michal Hajdušek, Rodney Van Meter
2022 arXiv   pre-print
We propose an algorithm using a modified variant of amplitude amplification to solve combinatorial optimization problems via the use of a subdivided phase oracle.  ...  Finally, we discuss the speedup compared to classical schemes using the query complexity model, and show that our algorithm offers a significant advantage over these classical approaches.  ...  ACKNOWLEDGMENT This work was supported by MEXT Quantum Leap Flagship Program Grant Number JPMXS0118067285 and JP-MXS0120319794.  ... 
arXiv:2205.00602v1 fatcat:zcgkvy7lkbg7pps22e6dvni43u

A New Approach to Model Counting [chapter]

Wei Wei, Bart Selman
2005 Lecture Notes in Computer Science  
Our ApproxCount algorithm is based on SampleSat, a new algorithm that samples from the solution space of a propositional logic formula near-uniformly.  ...  Many AI tasks, such as calculating degree of belief and reasoning in Bayesian networks, are computationally equivalent to model counting.  ...  One can get a faster (and less accurate) approximation by reducing sample size. This is especially important in time-critical decision making.  ... 
doi:10.1007/11499107_24 fatcat:kcx3wvphabbnpmjofo732qlmoe
« Previous Showing results 1 — 15 out of 2,143 results