Search results for "epsilon nets"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	János Pach, Gábor Tardos	Tight lower bounds for the size of epsilon-nets.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Pablo Diaz-Gutierrez, Jonas Bösch, Renato Pajarola, Meenakshisundaram Gopi	Streaming surface sampling using Gaussian epsilon-nets.	The Visual Computer	2009	DBLP DOI BibTeX RDF	Normal quantization, Surface sampling, Shape approximation, Epsilon-nets
2	Kasturi R. Varadarajan	Epsilon nets and union complexity.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	approximation algorithms, set cover, epsilon nets
2	Saurabh Ray, Nabil H. Mustafa	Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	hitting convex sets, weak epsilon nets, discrete geometry, combinatorial geometry
2	Jivri Matouaek	New constructions of weak epsilon-nets.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	weak epsilon-nets
2	Phillip G. Bradford, Vasilis Capoyleas	Weak epsilon-Nets for Points on a Hypersphere.	Discrete & Computational Geometry	1997	DBLP DOI BibTeX RDF
1	Noga Alon	A Non-linear Lower Bound for Planar Epsilon-nets.	Discrete & Computational Geometry	2012	DBLP DOI BibTeX RDF
1	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
1	Esther Ezra	A note about weak epsilon-nets for axis-parallel boxes in d-space.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	János Pach, Gábor Tardos	Tight lower bounds for the size of epsilon-nets	CoRR	2010	DBLP BibTeX RDF
1	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
1	Thomas Zeugmann	Epsilon Nets.	Encyclopedia of Machine Learning	2010	DBLP DOI BibTeX RDF
1	Pradeesha Ashok, Sathish Govindarajan, Janardhan Kulkarni	Small strong epsilon nets.	CCCG	2010	DBLP BibTeX RDF
1	Noga Alon	A Non-linear Lower Bound for Planar Epsilon-Nets.	FOCS	2010	DBLP DOI BibTeX RDF
1	Kasturi Varadarajan	Weighted geometric set cover via quasi-uniform sampling.	STOC	2010	DBLP DOI BibTeX RDF	approximation, set cover, epsilon nets
1	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
1	Boris Bukh, Jirí Matousek, Gabriel Nivasch	Lower bounds for weak epsilon-nets and stair-convexity.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	inverse ackermann function, selection lemma, stair-convexity, weak epsilon-net
1	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
1	Nabil H. Mustafa, Saurabh Ray	PTAS for geometric hitting set problems via local search.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	approximation algorithm, local search, hitting sets, epsilon nets
1	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
1	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
1	Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky	Weak ε-nets and interval chains.	SODA	2008	DBLP DOI BibTeX RDF
1	Evangelia Pyrga, Saurabh Ray	New existence proofs epsilon-nets.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	strong ?-nets, discrete geometry, hitting sets, hypergraph transversals
1	Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich	Deterministic sampling and range counting in geometric data streams.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	geometric data, iceberg queries, range counting, Data streams, sampling, robust statistics, streaming algorithms, epsilon nets
1	Maryam Babazadeh, Hamid Zarrabi-Zadeh	Small Weak Epsilon-Nets in Three Dimensions.	CCCG	2006	DBLP BibTeX RDF
1	Kenneth L. Clarkson	Building triangulations using epsilon-nets.	STOC	2006	DBLP DOI BibTeX RDF	Delone, meshes, curvature, manifolds
1	Luc Devroye	Random Multivariate Search Trees.	COLT	2006	DBLP DOI BibTeX RDF
1	Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara	Small weak epsilon nets.	CCCG	2005	DBLP BibTeX RDF
1	Jirí Matousek, Uli Wagner	New Constructions of Weak epsilon-Nets.	Discrete & Computational Geometry	2004	DBLP DOI BibTeX RDF
1	Jirí Matousek	A Lower Bound for Weak epsilon-Nets in High Dimension.	Discrete & Computational Geometry	2002	DBLP DOI BibTeX RDF
1	Alexandre Tiskin	Parallel Convex Hull Computation by Generalised Regular Sampling.	Euro-Par	2002	DBLP DOI BibTeX RDF
1	Edgar A. Ramos	An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set.	Discrete & Computational Geometry	2001	DBLP DOI BibTeX RDF
1	Gil Kalai	Fractional Helly theorem, weak epsilon nets and geometric piercing.	CCCG	2000	DBLP BibTeX RDF
1	Thomas Burger, Peter Gritzmann	Finding Optimal Shadows of Polytopes.	Discrete & Computational Geometry	2000	DBLP DOI BibTeX RDF
1	Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl	Improved Bounds on Weak epsilon-Nets for Convex Sets.	Discrete & Computational Geometry	1995	DBLP DOI BibTeX RDF
1	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
1	János Komlós, János Pach, Gerhard J. Woeginger	Almost Tight Bounds for epsilon-Nets.	Discrete & Computational Geometry	1992	DBLP DOI BibTeX RDF
1	Jirí Matousek	Construction of epsilon-Nets.	Discrete & Computational Geometry	1990	DBLP DOI BibTeX RDF
1	Jirí Matousek	Raimund Seidel, Emo Welzl: How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces.	Symposium on Computational Geometry	1990	DBLP DOI BibTeX RDF
1	János Pach, Gerhard J. Woeginger	Some New Bounds for Epsilon-Nets.	Symposium on Computational Geometry	1990	DBLP DOI BibTeX RDF
1	Jirí Matousek	Construction of epsilon Nets.	Symposium on Computational Geometry	1989	DBLP DOI BibTeX RDF
1	Gerhard J. Woeginger	Epsilon-Nets for Halfplanes.	WG	1988	DBLP DOI BibTeX RDF
1	David Haussler, Emo Welzl	epsilon-Nets and Simplex Range Queries.	Discrete & Computational Geometry	1987	DBLP DOI BibTeX RDF
1	David Haussler, Emo Welzl	Epsilon-Nets and Simplex Range Queries.	Symposium on Computational Geometry	1986	DBLP DOI BibTeX RDF