|
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 18(1), pp. 83-91, 1997. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 239-244, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011, pp. 458-463, 2011, ACM, 978-1-4503-0682-9. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
51 | Pablo Diaz-Gutierrez, Jonas Bösch, Renato Pajarola, Meenakshisundaram Gopi |
Streaming surface sampling using Gaussian epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 25(5-7), pp. 411-421, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Normal quantization, Surface sampling, Shape approximation, Epsilon-nets |
51 | Kasturi R. Varadarajan |
Epsilon nets and union complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 11-16, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, set cover, epsilon nets |
51 | Jirí Matousek 0001 |
New constructions of weak epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003, pp. 129-135, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
weak epsilon-nets |
37 | Nabil H. Mustafa, Kasturi R. Varadarajan |
Epsilon-approximations and epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1702.03676, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Geom. ![In: Comput. Geom. 43(6-7), pp. 565-571, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Geom. ![In: Comput. Geom. 40(1), pp. 84-91, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Kasturi R. Varadarajan |
Weighted geometric set cover via quasi-uniform sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 641-648, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 17-22, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(2), pp. 16, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings, pp. 392-399, 2002, Springer, 3-540-44049-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Natan Rubin |
An Improved Bound for Weak Epsilon-nets in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 69(5), pp. 32:1-32:35, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Michal Oszmaniec, Adam Sawicki, Michal Horodecki |
Epsilon-Nets, Unitary Designs, and Random Quantum Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 68(2), pp. 989-1015, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Natan Rubin |
Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.12654, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | Natan Rubin |
Stronger bounds for weak epsilon-nets in higher dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 989-1002, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Andrey Kupavskii, Nikita Zhivotovskiy |
When are epsilon-nets small? ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 110, pp. 22-36, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Daniel Bertschinger, Patrick Schnider |
Weighted Epsilon-Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.08693, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Pablo Soberón |
Tverberg Partitions as Weak Epsilon-Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 39(2), pp. 447-458, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Nabil H. Mustafa |
Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece., pp. 87:1-87:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-109-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Shay Moran, Amir Yehudayoff |
On Weak epsilon-Nets and the Radon Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 51:1-51:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Nabil H. Mustafa, Kunal Dutta, Arijit Ghosh |
A Simple Proof of Optimal Epsilon Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 38(5), pp. 1269-1277, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Natan Rubin |
An Improved Bound for Weak Epsilon-Nets in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.02686, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Natan Rubin |
An Improved Bound for Weak Epsilon-Nets in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 224-235, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Thomas Zeugmann |
Epsilon Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Machine Learning and Data Mining ![In: Encyclopedia of Machine Learning and Data Mining, pp. 409-410, 2017, Springer, 978-1-4899-7685-7. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Andrey Kupavskii, Nikita Zhivotovskiy |
When are epsilon-nets small? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1711.10414, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
23 | Andrey Kupavskii, Nabil H. Mustafa, János Pach |
New Lower Bounds for epsilon-Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA, pp. 54:1-54:16, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-009-5. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Maria A. Ivanchuk, Igor V. Malyk |
Using \epsilon -nets for Solving the Classification Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NAA ![In: Numerical Analysis and Its Applications - 6th International Conference, NAA 2016, Lozenetz, Bulgaria, June 15-22, 2016, Revised Selected Papers, pp. 367-374, 2016, 978-3-319-57098-3. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray |
Tighter Estimates for epsilon-nets for Disks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1501.03246, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
23 | Pradeesha Ashok, Umair Azmi, Sathish Govindarajan |
Small strong epsilon nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Geom. ![In: Comput. Geom. 47(9), pp. 899-909, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Sariel Har-Peled, Haim Kaplan, Micha Sharir, Shakhar Smorodinsky |
Epsilon-Nets for Halfspaces Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1410.3154, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
23 | Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid |
Voronoi Games and Epsilon Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014, 2014, Carleton University, Ottawa, Canada. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
23 | Pradeesha Ashok, Umair Azmi, Sathish Govindarajan |
Small Strong Epsilon Nets ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1208.2785, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
23 | Ilya P. Razenshteyn |
On Epsilon-Nets, Distance Oracles, and Metric Embeddings ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1206.4164, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
23 | Noga Alon |
A Non-linear Lower Bound for Planar Epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 47(2), pp. 235-244, 2012. The full citation details ...](Pics/full.jpeg) |
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? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1111.5979, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
23 | Thomas Zeugmann |
Epsilon Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Machine Learning ![In: Encyclopedia of Machine Learning, pp. 326-327, 2010, Springer, 978-0-387-30768-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Esther Ezra |
A note about weak epsilon-nets for axis-parallel boxes in d-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 110(18-19), pp. 835-840, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | János Pach, Gábor Tardos |
Tight lower bounds for the size of epsilon-nets ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1012.1240, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
23 | Noga Alon |
A Non-linear Lower Bound for Planar Epsilon-Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA, pp. 341-346, 2010, IEEE Computer Society, 978-0-7695-4244-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Pradeesha Ashok, Sathish Govindarajan, Janardhan Kulkarni |
Small strong epsilon nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010, pp. 155-158, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
23 | Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky |
Small weak epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Geom. ![In: Comput. Geom. 42(5), pp. 455-462, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Boris Bukh, Jirí Matousek 0001, Gabriel Nivasch |
Lower bounds for weak epsilon-nets and stair-convexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 1-10, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 639-648, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2009 |
RDF |
|
23 | Gabriel Nivasch |
Weak epsilon-nets, Davenport-Schinzel sequences, and related problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2009 |
RDF |
|
23 | Boris Bukh, Jirí Matousek 0001, Gabriel Nivasch |
Lower bounds for weak epsilon-nets and stair-convexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0812.5039, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
23 | Evangelia Pyrga, Saurabh Ray |
New existence proofs epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 199-207, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006, August 14-16, 2006, Queen's University, Ontario, Canada, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
23 | Kenneth L. Clarkson |
Building triangulations using epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 326-335, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG'05, University of Windsor, Ontario, Canada, August 10-12, 2005, pp. 52-56, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
23 | Jirí Matousek 0001, Uli Wagner 0001 |
New Constructions of Weak epsilon-Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(2), pp. 195-206, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Jirí Matousek 0001 |
A Lower Bound for Weak epsilon-Nets in High Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 28(1), pp. 45-48, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Gil Kalai |
Fractional Helly theorem, weak epsilon nets and geometric piercing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 12th Canadian Conference on Computational Geometry, Fredericton, New Brunswick, Canada, August 16-19, 2000, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 13, pp. 1-15, 1995. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, pp. 495-504, 1993, ACM, 0-89791-591-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
23 | János Komlós, János Pach, Gerhard J. Woeginger |
Almost Tight Bounds for epsilon-Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 7, pp. 163-173, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
23 | Jirí Matousek 0001 |
Construction of epsilon-Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 5, pp. 427-448, 1990. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990, pp. 16-22, 1990, ACM, 0-89791-362-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
23 | János Pach, Gerhard J. Woeginger |
Some New Bounds for Epsilon-Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990, pp. 10-15, 1990, ACM, 0-89791-362-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
23 | Jirí Matousek 0001 |
Construction of epsilon Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbrücken, Germany, June 5-7, 1989, pp. 1-10, 1989, ACM, 0-89791-318-3. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
23 | Gerhard J. Woeginger |
Epsilon-Nets for Halfplanes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings, pp. 243-252, 1988, Springer, 3-540-50728-0. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
23 | David Haussler, Emo Welzl |
epsilon-Nets and Simplex Range Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 2, pp. 127-151, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
23 | David Haussler, Emo Welzl |
Epsilon-Nets and Simplex Range Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, Yorktown Heights, NY, USA, June 2-4, 1986, pp. 61-71, 1986, ACM, 0-89791-194-6. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
20 | Yuval Rabani, Amir Shpilka |
Explicit construction of a small epsilon-net for linear threshold functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 649-658, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
linear threshold function, explicit construction, epsilon-net |
15 | Luc Devroye |
Random Multivariate Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings, pp. 1, 2006, Springer, 3-540-35294-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Edgar A. Ramos |
An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 26(2), pp. 233-244, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Thomas Burger, Peter Gritzmann |
Finding Optimal Shadows of Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 24(2-3), pp. 219-240, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #69 of 69 (100 per page; Change: )
|
|