Filters








28 Hits in 8.5 sec

Visualization of discrete gradient construction

Attila Gyulassy, Joshua Aaron Levine, Valerio Pascucci
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqbrzpfj5rc3pcxpllbrit3n4q" style="color: black;">Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG &#39;11</a> </i> &nbsp;
This video presents a visualization of a recent algorithm to compute discrete gradient fields on regular cell complexes [3] .  ...  We describe the stages of the algorithm, highlighting both its simplicity and generality.  ...  Copyright is held by the author/owner(s). SCG'11, June 13-15, 2011, Paris, France. ACM 978-1-4503-0682-9/11/06.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998241">doi:10.1145/1998196.1998241</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compgeom/GyulassyLP11.html">dblp:conf/compgeom/GyulassyLP11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nc44dnnyivevzcgm3krqxed47u">fatcat:nc44dnnyivevzcgm3krqxed47u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150919121100/http://www.sci.utah.edu/publications/gyulassy11/Gyulassy_SymCompGeo2011.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ce/f8/cef889376b82d82869abd5815c3dfab2e70fc097.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998241"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A pedagogic JavaScript program for point location strategies

Olivier Devillers, Pedro Machado Manhães de Castro
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqbrzpfj5rc3pcxpllbrit3n4q" style="color: black;">Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG &#39;11</a> </i> &nbsp;
Point location in triangulations is a classical problem in computational geometry. And walking in a triangulation is often used as the starting point for several nice point location strategies.  ...  We present a pedagogic JavaScript program demonstrating some of these strategies, which is available at: www-sop.inria.fr/geometrica/demo/point location strategies/.  ...  Viewing/Hiding vertices and edges can be done by choosing the appropriate options in the Show Vertices and Show Edges check boxes. SCG'11, June 13-15, 2011, Paris, France.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998244">doi:10.1145/1998196.1998244</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compgeom/DevillersC11.html">dblp:conf/compgeom/DevillersC11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/46ae6smeafczhdrvdc4vorgexe">fatcat:46ae6smeafczhdrvdc4vorgexe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705105306/http://www-sop.inria.fr/geometrica/demo/point_location_strategies/txt/scg.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/23/04/230497bed75d554905baa0f6227d03988766d2df.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998244"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Minimum perimeter convex hull of imprecise points in convex regions

Christophe Weibel, Linqiao Zhang
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqbrzpfj5rc3pcxpllbrit3n4q" style="color: black;">Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG &#39;11</a> </i> &nbsp;
The research we present in this video focuses on the problem of finding the minimum perimeter convex hull of a set of imprecise points, where each uncertainty region is closed, convex, and the regions  ...  We first present and animate our theoretical findings: as each point moves inside its uncertainty region, the perimeter of the resulting convex hull is a convex function on the position of the points;  ...  Special cases of the problem, such as Copyright is held by the author/owner(s). SCG'11, June 13-15, 2011, Paris, France.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998243">doi:10.1145/1998196.1998243</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compgeom/WeibelZ11.html">dblp:conf/compgeom/WeibelZ11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hnsqn5dzubbjlghxeepldcd3bq">fatcat:hnsqn5dzubbjlghxeepldcd3bq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110813032854/http://www.cs.dartmouth.edu:80/~weibel/minPeriAbs.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8c/21/8c219e6e038cac594388489a2da712e2275061ee.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998243"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Persistence-based clustering in riemannian manifolds

Frédéric Chazal, Leonidas J. Guibas, Steve Y. Oudot, Primoz Skraba
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqbrzpfj5rc3pcxpllbrit3n4q" style="color: black;">Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG &#39;11</a> </i> &nbsp;
Proximity of persistence modules and their diagrams. In Proceedings of the 25th ACM Symposium on Computing Geometry. 237–246. hazal, L. J. Guibas, S. Y. Oudot, and P. Skraba. 2011.  ...  Stability of persistence diagrams. In Proceedings of he 21st ACM Symposium on Computing Geometry. 263–271. ohen-Steiner, H. Edelsbrunner, and J. Harer. 2007. Stability of persistence diagrams.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998212">doi:10.1145/1998196.1998212</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compgeom/ChazalGOS11.html">dblp:conf/compgeom/ChazalGOS11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/z3drfytzwrappaxcw5nyftxqdu">fatcat:z3drfytzwrappaxcw5nyftxqdu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810080437/http://geometrica.saclay.inria.fr/team/Fred.Chazal/papers/cgos-pbc-09/a41-chazal.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/03/e6/03e6fee882ef0d94282485dc08002009bc77afdf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998212"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Metric graph reconstruction from noisy data

Mridul Aanjaneya, Frederic Chazal, Daniel Chen, Marc Glisse, Leonidas J. Guibas, Dmitriy Morozov
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqbrzpfj5rc3pcxpllbrit3n4q" style="color: black;">Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG &#39;11</a> </i> &nbsp;
Building on the notions of correspondence and Gromov-Hausdorff distance in metric geometry, we describe a model for such data sets as an approximation of an underlying metric graph.  ...  We also implement the algorithm, and evaluate its performance on a variety of real world data sets.  ...  Now, if (x , y ), (x , y ) ∈ C are such that y , y ∈ B Y (y, (1 + α)r) \ B Y (y, r) and d Y (y , y ) < 2αr then d X (x , x ) < 2αr + ε and, since r > SCG'11, June 13-15, 2011, Paris, France.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998203">doi:10.1145/1998196.1998203</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compgeom/AanjaneyaCCGGM11.html">dblp:conf/compgeom/AanjaneyaCCGGM11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/llpnuprip5eczdqxfwkmccfek4">fatcat:llpnuprip5eczdqxfwkmccfek4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810111138/http://fodava.gatech.edu/sites/default/files/FODAVA-11-26.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/5a/d45af4ed12cbf3913e79137a6462b77981524741.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998203"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Shortest non-trivial cycles in directed surface graphs

Jeff Erickson
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqbrzpfj5rc3pcxpllbrit3n4q" style="color: black;">Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG &#39;11</a> </i> &nbsp;
Let G be a directed graph embedded on a surface of genus g.  ...  We also describe an algorithm to compute the shortest non-contractible cycle in G in g O(g) n log n time, matching the fastest algorithm for undirected graphs of constant genus.  ...  Thanks to Yahav Nussbaum for communicating the error in Janiga and Koubek's algorithm [34, 35] and to the anonymous reviewers for their extraordinarily careful reading and suggestions for improvement  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998231">doi:10.1145/1998196.1998231</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compgeom/Erickson11.html">dblp:conf/compgeom/Erickson11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zndqeloqv5b3fa5h6da6ns2om4">fatcat:zndqeloqv5b3fa5h6da6ns2om4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808181916/http://jeffe.cs.illinois.edu/pubs/pdf/wobble.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/96/93/9693a877937311e1033a7a31dcff28981cc3e6ef.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998231"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Computing top-k Closeness Centrality Faster in Unweighted Graphs [article]

Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
<span title="2017-04-27">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
on computing the distance between all pairs of vertices, and the state of the art.  ...  For example, we are able to compute the top k nodes in few dozens of seconds in real-world networks with millions of nodes and edges.  ...  In Proceedings of the 27th ACM/SIAM Symposium on Discrete Algorithms (SODA). 377–391. Amir Abboud, Virginia V. Williams, and Oren Weimann. 2014.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1704.01077v2">arXiv:1704.01077v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gc32wvmmdzhczka6rv7h3c7ajy">fatcat:gc32wvmmdzhczka6rv7h3c7ajy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200928164358/https://arxiv.org/pdf/1704.01077v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b1/ea/b1ea5527b3768ea5b112031958c517f50f13bc5c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1704.01077v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Zigzag persistent homology in matrix multiplication time

Nikola Milosavljević, Dmitriy Morozov, Primoz Skraba
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqbrzpfj5rc3pcxpllbrit3n4q" style="color: black;">Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG &#39;11</a> </i> &nbsp;
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of simplex additions and deletions  ...  In particular, the running time is O(n 2.376 ), by result of Coppersmith and Winograd. The fastest previously known algorithm for this problem takes O(n 3 ) time in the worst case.  ...  Acknowledgement The authors would like to thank Leonidas Guibas, Gunnar Carlsson and Frédéric Chazal for their support.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998229">doi:10.1145/1998196.1998229</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compgeom/MilosavljevicMS11.html">dblp:conf/compgeom/MilosavljevicMS11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6eruiprfafeadjkfizmgalmtwq">fatcat:6eruiprfafeadjkfizmgalmtwq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809022423/http://ailab.ijs.si/primoz_skraba/papers/morozov-zzph-mmt-socg11.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/49/74/49743d9d4f6410f2436df7bce3aeec69df6a44a0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998229"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Algorithmic Fairness Datasets: the Story so Far [article]

Alessandro Fabris, Stefano Messina, Gianmaria Silvello, Gian Antonio Susto
<span title="2022-05-06">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
As a result, a growing community of researchers has been investigating the equity of existing algorithms and proposing novel ones, advancing the understanding of risks and opportunities of automated decision-making  ...  Unfortunately, the algorithmic fairness community suffers from a collective data documentation debt caused by a lack of information on specific resources (opacity) and scatteredness of available information  ...  Acknowledgements The authors would like to thank the following researchers and dataset creators for the useful feedback on the data briefs: Alain Barrat, Luc Behaghel, Asia Biega, Marko Bohanec, Chris  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2202.01711v2">arXiv:2202.01711v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5hf4a42pubc5vnt7tw3al4m5bq">fatcat:5hf4a42pubc5vnt7tw3al4m5bq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220510061614/https://arxiv.org/pdf/2202.01711v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/91/57/9157d70f2c3204c064712f70a021455e4e4fb88b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2202.01711v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14) [article]

L. Jacques, C. De Vleeschouwer, Y. Boursier, P. Sudhakar, C. De Mol, A. Pizurica, S. Anthoine, P. Vandergheynst, P. Frossard, C. Bilen, S. Kitic, N. Bertin, R. Gribonval, N. Boumal (+51 others)
<span title="2014-10-09">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
For its second edition, the iTWIST workshop took place in the medieval and picturesque town of Namur in Belgium, from Wednesday August 27th till Friday August 29th, 2014.  ...  talks, 10 oral presentations, and 14 posters on the following themes, all related to the theory, application and generalization of the "sparsity paradigm": Sparsity-driven data sensing and processing;  ...  In [3], the authors introduced the notion of decomposable norms. In fact, one can show that their regularizers are a very special subclass of ours.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1410.0719v2">arXiv:1410.0719v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4y3drgk3ujh5hopfn2p2runlzu">fatcat:4y3drgk3ujh5hopfn2p2runlzu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191016141310/https://arxiv.org/pdf/1410.0719v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8d/f4/8df478e43ef682f2ba5f2c360267ea7f61a1077b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1410.0719v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Convergence rate of stochastic k-means [article]

Cheng Tang, Claire Monteleoni
<span title="2016-11-07">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The k-means objective is non-convex and non-differentiable: we exploit ideas from non-convex gradient-based optimization by providing a novel characterization of the trajectory of k-means algorithm on  ...  We show, for the first time, that they have global convergence towards local optima at O(1/t) rate under general conditions.  ...  In Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, STOC '13, pages 665-674, New York, NY, USA, 2013. ACM. [13] Tapas Kanungo, David M. Mount, Nathan S.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1610.04900v2">arXiv:1610.04900v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5zpfr3qxbjg4hebnbmgzud3y4e">fatcat:5zpfr3qxbjg4hebnbmgzud3y4e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200905135315/https://arxiv.org/pdf/1610.04900v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8f/d6/8fd61c69f23f862c6d421af9cd9e9d5cbf484de1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1610.04900v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Minors in random and expanding hypergraphs

Uli Wagner
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqbrzpfj5rc3pcxpllbrit3n4q" style="color: black;">Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG &#39;11</a> </i> &nbsp;
without doubly covered image points (embeddings), we consider maps without qfold covered image points. 1 Even the dependence of the constants on t is now known quite precisely, C(t) ≈ 0.319t √ log t and  ...  In this paper, we focus on threshold problems. The basic model for random complexes is the Linial-Meshulam model X k (n, p).  ...  Acknowledgements Part of this research was conducted during visits to the Hebrew University of Jerusalem and Cornell University, respectively, and I am indebted to Gil Kalai, Nati Linial, and Eran Nevo  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998256">doi:10.1145/1998196.1998256</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compgeom/Wagner11.html">dblp:conf/compgeom/Wagner11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/unq53imjuramndjovjaxwkgdbq">fatcat:unq53imjuramndjovjaxwkgdbq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809144016/https://www.inf.ethz.ch/personal/uwagner/Manuscripts/MinorsRandomHypergraphs.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1a/c2/1ac264b7a77d8f2d3ce81706446701e941bc65cd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1998196.1998256"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

TALLINNA TEHNIKAÜLIKOOLI PUBLIKATSIOONID 2015

Tallinna Raamatukogu
<span class="release-stage">unpublished</span>
+EPIC5 : September 27th -October 1st 2015, Nice, France : abstract book.  ...  Events, Paris, France, November 3-6, 2014 : revised selected papers.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/p556mpv4orbjdgjfr27ihjqk3q">fatcat:p556mpv4orbjdgjfr27ihjqk3q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180518161039/https://www.ttu.ee/public/r/raamatukogu/Infoallikad/TTU_Publikatsioonid/TTU_2015.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/eb/67/eb67e60f966409600c4f89827b9aafc46cb3d5b1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Reasoning about Interaction: From Game Theory to Logic and Back (Dagstuhl Seminar 11101) Computational Geometry (Dagstuhl Seminar 11111) Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121) Exploration and Curiosity in Robot Learning and Inference (Dagstuhl Seminar 11131)

Jürgen Dix, Wojtek Jamroga, Dov, Pankaj Agarwal, Kurt Mehlhorn, Monique, Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter Van, Jeremy Wyatt, Peter Dayan (+2 others)
<span title="">2011</span> <span class="release-stage">unpublished</span>
Acknowledgements This work was supported by the FNR (National Research Fund) Luxembourg under projects S-GAMES, C08/IS/03 and GMASec -PHD/09/082.  ...  ., Paris, France, June 13-15 2011 URL http://hal.archives-ouvertes.fr/hal-00579864/en/ We associate with each compact set X of R n two real-valued functions c X and h X defined on R + which provide two  ...  GIS '10: Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lcqcxdam4rfcbecsifbfdfapna">fatcat:lcqcxdam4rfcbecsifbfdfapna</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180518202302/http://drops.dagstuhl.de/opus/volltexte/2011/3210/pdf/dagrep-v001-i003-complete.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/16/d3/16d319cdf5745bfa43d1f9b1e7539abb20c1612c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Algorithmic Fairness Datasets: the Story so Far [article]

Alessandro Fabris, Stefano Messina, Gianmaria Silvello, Gian Antonio Susto
<span title="2022-02-01">2022</span>
As a result, a growing community of algorithmic fairness researchers has been investigating the equity of existing algorithms and proposing novel ones, advancing the understanding of the risks and opportunities  ...  Unfortunately, the algorithmic fairness community, as a whole, suffers from a collective data documentation debt caused by a lack of information on specific resources (opacity) and scatteredness of available  ...  Acknowledgements The authors would like to thank the following researchers and dataset creators for the useful feedback on the data briefs: Alain Barrat, Luc  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.48550/arxiv.2202.01711">doi:10.48550/arxiv.2202.01711</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mav36x3w5namjhurzpevtsmsju">fatcat:mav36x3w5namjhurzpevtsmsju</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220204014816/https://arxiv.org/pdf/2202.01711.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d8/13/d81324efaae580a9cf6d031dece5ca6891fa0887.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.48550/arxiv.2202.01711"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 28 results