|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 30 occurrences of 19 keywords
|
|
|
Results
Found 69 publication records. Showing 69 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
102 | Phillip G. Bradford, Vasilis Capoyleas |
Weak epsilon-Nets for Points on a Hypersphere. |
Discret. Comput. Geom. |
1997 |
DBLP DOI BibTeX RDF |
|
80 | Saurabh Ray, Nabil H. Mustafa |
Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension. |
SCG |
2007 |
DBLP DOI BibTeX RDF |
hitting convex sets, weak epsilon nets, discrete geometry, combinatorial geometry |
53 | János Pach, Gábor Tardos |
Tight lower bounds for the size of epsilon-nets. |
SCG |
2011 |
DBLP DOI BibTeX RDF |
|
51 | Pablo Diaz-Gutierrez, Jonas Bösch, Renato Pajarola, Meenakshisundaram Gopi |
Streaming surface sampling using Gaussian epsilon-nets. |
Vis. Comput. |
2009 |
DBLP DOI BibTeX RDF |
Normal quantization, Surface sampling, Shape approximation, Epsilon-nets |
51 | Kasturi R. Varadarajan |
Epsilon nets and union complexity. |
SCG |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, set cover, epsilon nets |
51 | Jirí Matousek 0001 |
New constructions of weak epsilon-nets. |
SCG |
2003 |
DBLP DOI BibTeX RDF |
weak epsilon-nets |
37 | Nabil H. Mustafa, Kasturi R. Varadarajan |
Epsilon-approximations and epsilon-nets. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
37 | Nabil H. Mustafa, Saurabh Ray |
Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. |
Comput. Geom. |
2010 |
DBLP DOI BibTeX RDF |
|
37 | Nabil H. Mustafa, Saurabh Ray |
Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. |
Comput. Geom. |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Kasturi R. Varadarajan |
Weighted geometric set cover via quasi-uniform sampling. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
approximation, set cover, epsilon nets |
28 | Nabil H. Mustafa, Saurabh Ray |
PTAS for geometric hitting set problems via local search. |
SCG |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithm, local search, hitting sets, epsilon nets |
28 | Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich |
Deterministic sampling and range counting in geometric data streams. |
ACM Trans. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
geometric data, iceberg queries, range counting, Data streams, sampling, robust statistics, streaming algorithms, epsilon nets |
26 | Alexandre Tiskin |
Parallel Convex Hull Computation by Generalised Regular Sampling. |
Euro-Par |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Natan Rubin |
An Improved Bound for Weak Epsilon-nets in the Plane. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Michal Oszmaniec, Adam Sawicki, Michal Horodecki |
Epsilon-Nets, Unitary Designs, and Random Quantum Circuits. |
IEEE Trans. Inf. Theory |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Natan Rubin |
Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
23 | Natan Rubin |
Stronger bounds for weak epsilon-nets in higher dimensions. |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Andrey Kupavskii, Nikita Zhivotovskiy |
When are epsilon-nets small? |
J. Comput. Syst. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Daniel Bertschinger, Patrick Schnider |
Weighted Epsilon-Nets. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
23 | Pablo Soberón |
Tverberg Partitions as Weak Epsilon-Nets. |
Comb. |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Nabil H. Mustafa |
Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set. |
ICALP |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Shay Moran, Amir Yehudayoff |
On Weak epsilon-Nets and the Radon Number. |
SoCG |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Nabil H. Mustafa, Kunal Dutta, Arijit Ghosh |
A Simple Proof of Optimal Epsilon Nets. |
Comb. |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Natan Rubin |
An Improved Bound for Weak Epsilon-Nets in the Plane. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
23 | Natan Rubin |
An Improved Bound for Weak Epsilon-Nets in the Plane. |
FOCS |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Thomas Zeugmann |
Epsilon Nets. |
Encyclopedia of Machine Learning and Data Mining |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Andrey Kupavskii, Nikita Zhivotovskiy |
When are epsilon-nets small? |
CoRR |
2017 |
DBLP BibTeX RDF |
|
23 | Andrey Kupavskii, Nabil H. Mustafa, János Pach |
New Lower Bounds for epsilon-Nets. |
SoCG |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Maria A. Ivanchuk, Igor V. Malyk |
Using \epsilon -nets for Solving the Classification Problem. |
NAA |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray |
Tighter Estimates for epsilon-nets for Disks. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
23 | Pradeesha Ashok, Umair Azmi, Sathish Govindarajan |
Small strong epsilon nets. |
Comput. Geom. |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Sariel Har-Peled, Haim Kaplan, Micha Sharir, Shakhar Smorodinsky |
Epsilon-Nets for Halfspaces Revisited. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
23 | Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid |
Voronoi Games and Epsilon Nets. |
CCCG |
2014 |
DBLP BibTeX RDF |
|
23 | Pradeesha Ashok, Umair Azmi, Sathish Govindarajan |
Small Strong Epsilon Nets |
CoRR |
2012 |
DBLP BibTeX RDF |
|
23 | Ilya P. Razenshteyn |
On Epsilon-Nets, Distance Oracles, and Metric Embeddings |
CoRR |
2012 |
DBLP BibTeX RDF |
|
23 | Noga Alon |
A Non-linear Lower Bound for Planar Epsilon-nets. |
Discret. Comput. Geom. |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Christian Knauer, Daniel Werner |
Erdős-Szekeres and Testing Weak epsilon-Nets are NP-hard in 3 dimensions - and what now? |
CoRR |
2011 |
DBLP BibTeX RDF |
|
23 | Thomas Zeugmann |
Epsilon Nets. |
Encyclopedia of Machine Learning |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Esther Ezra |
A note about weak epsilon-nets for axis-parallel boxes in d-space. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
23 | János Pach, Gábor Tardos |
Tight lower bounds for the size of epsilon-nets |
CoRR |
2010 |
DBLP BibTeX RDF |
|
23 | Noga Alon |
A Non-linear Lower Bound for Planar Epsilon-Nets. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Pradeesha Ashok, Sathish Govindarajan, Janardhan Kulkarni |
Small strong epsilon nets. |
CCCG |
2010 |
DBLP BibTeX RDF |
|
23 | Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky |
Small weak epsilon-nets. |
Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Boris Bukh, Jirí Matousek 0001, Gabriel Nivasch |
Lower bounds for weak epsilon-nets and stair-convexity. |
SCG |
2009 |
DBLP DOI BibTeX RDF |
inverse ackermann function, selection lemma, stair-convexity, weak epsilon-net |
23 | Boris Aronov, Esther Ezra, Micha Sharir |
Small-size epsilon-nets for axis-parallel rectangles and boxes. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
?-nets, geometric range spaces, randomized algorithms, set cover, hitting set |
23 | Saurabh Ray |
Weak and strong epsilon-nets for geometric range spaces. |
|
2009 |
RDF |
|
23 | Gabriel Nivasch |
Weak epsilon-nets, Davenport-Schinzel sequences, and related problems |
|
2009 |
RDF |
|
23 | Boris Bukh, Jirí Matousek 0001, Gabriel Nivasch |
Lower bounds for weak epsilon-nets and stair-convexity. |
CoRR |
2008 |
DBLP BibTeX RDF |
|
23 | Evangelia Pyrga, Saurabh Ray |
New existence proofs epsilon-nets. |
SCG |
2008 |
DBLP DOI BibTeX RDF |
strong ?-nets, discrete geometry, hitting sets, hypergraph transversals |
23 | Maryam Babazadeh, Hamid Zarrabi-Zadeh |
Small Weak Epsilon-Nets in Three Dimensions. |
CCCG |
2006 |
DBLP BibTeX RDF |
|
23 | Kenneth L. Clarkson |
Building triangulations using epsilon-nets. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
Delone, meshes, curvature, manifolds |
23 | Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara |
Small weak epsilon nets. |
CCCG |
2005 |
DBLP BibTeX RDF |
|
23 | Jirí Matousek 0001, Uli Wagner 0001 |
New Constructions of Weak epsilon-Nets. |
Discret. Comput. Geom. |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Jirí Matousek 0001 |
A Lower Bound for Weak epsilon-Nets in High Dimension. |
Discret. Comput. Geom. |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Gil Kalai |
Fractional Helly theorem, weak epsilon nets and geometric piercing. |
CCCG |
2000 |
DBLP BibTeX RDF |
|
23 | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl |
Improved Bounds on Weak epsilon-Nets for Convex Sets. |
Discret. Comput. Geom. |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl |
Improved bounds on weak epsilon-nets for convex sets. |
STOC |
1993 |
DBLP DOI BibTeX RDF |
|
23 | János Komlós, János Pach, Gerhard J. Woeginger |
Almost Tight Bounds for epsilon-Nets. |
Discret. Comput. Geom. |
1992 |
DBLP DOI BibTeX RDF |
|
23 | Jirí Matousek 0001 |
Construction of epsilon-Nets. |
Discret. Comput. Geom. |
1990 |
DBLP DOI BibTeX RDF |
|
23 | Jirí Matousek 0001, Raimund Seidel, Emo Welzl |
How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces. |
SCG |
1990 |
DBLP DOI BibTeX RDF |
|
23 | János Pach, Gerhard J. Woeginger |
Some New Bounds for Epsilon-Nets. |
SCG |
1990 |
DBLP DOI BibTeX RDF |
|
23 | Jirí Matousek 0001 |
Construction of epsilon Nets. |
SCG |
1989 |
DBLP DOI BibTeX RDF |
|
23 | Gerhard J. Woeginger |
Epsilon-Nets for Halfplanes. |
WG |
1988 |
DBLP DOI BibTeX RDF |
|
23 | David Haussler, Emo Welzl |
epsilon-Nets and Simplex Range Queries. |
Discret. Comput. Geom. |
1987 |
DBLP DOI BibTeX RDF |
|
23 | David Haussler, Emo Welzl |
Epsilon-Nets and Simplex Range Queries. |
SCG |
1986 |
DBLP DOI BibTeX RDF |
|
20 | Yuval Rabani, Amir Shpilka |
Explicit construction of a small epsilon-net for linear threshold functions. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
linear threshold function, explicit construction, epsilon-net |
15 | Luc Devroye |
Random Multivariate Search Trees. |
COLT |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Edgar A. Ramos |
An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set. |
Discret. Comput. Geom. |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Thomas Burger, Peter Gritzmann |
Finding Optimal Shadows of Polytopes. |
Discret. Comput. Geom. |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #69 of 69 (100 per page; Change: )
|
|