Search results for "halfspace"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
99	Venkatesan Guruswami, Prasad Raghavendra	Hardness of Learning Halfspaces with Noise.	FOCS	2006	DBLP DOI BibTeX RDF
90	Sunil Arya, David M. Mount, Jian Xia	Tight lower bounds for halfspace range searching.	SCG	2010	DBLP DOI BibTeX RDF	lower bounds, range searching, idempotence
90	Hervé Brönnimann, Bernard Chazelle	How Hard is Halfspace Range Searching?	SCG	1992	DBLP DOI BibTeX RDF
74	Peyman Afshani, Timothy M. Chan	Optimal halfspace range reporting in three dimensions.	SODA	2009	DBLP DOI BibTeX RDF
74	Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, Rocco A. Servedio	Testing ±1-weight halfspace.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
66	Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, Rocco A. Servedio	Testing halfspaces.	SODA	2009	DBLP DOI BibTeX RDF
57	Alexander A. Sherstov	Halfspace Matrices.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	Subject classification. 03D15, 68Q17, 68Q15
57	Alexander A. Sherstov	Halfspace Matrices.	CCC	2007	DBLP DOI BibTeX RDF
51	Jirí Matousek 0001	Reporting Points in Halfspaces	FOCS	1991	DBLP DOI BibTeX RDF	query time, halfspace range reporting, query halfspace, linear storage, simplex range searching problem, deterministic preprocessing time, data structure
50	Jeff Erickson 0001	Better Lower Bounds for Halfspace Emptiness.	FOCS	1996	DBLP DOI BibTeX RDF	halfspace emptiness, query region, computational complexity, lower bounds, points, polyhedron, facets, partitioning algorithms, hyperplanes, polylogarithmic factors
49	Adam Tauman Kalai	Learning Nested Halfspaces and Uphill Decision Trees.	COLT	2007	DBLP DOI BibTeX RDF
49	David Bremner	Incremental Convex Hull Algorithms Are Not Output Sensitive.	ISAAC	1996	DBLP DOI BibTeX RDF
42	Timothy M. Chan	Optimal partition trees.	SCG	2010	DBLP DOI BibTeX RDF	halfspace range searching, simplex range searching, geometric data structures
42	David Bremner, Dan Chen 0003, John Iacono, Stefan Langerman, Pat Morin	Output-sensitive algorithms for Tukey depth and related problems.	Stat. Comput.	2008	DBLP DOI BibTeX RDF	Tukey depth, Halfspace depth, Computational statistics, Algorithms, Computational geometry, Fixed-parameter tractability
41	Boris Aronov, Sariel Har-Peled, Micha Sharir	On approximate halfspace range counting and relative epsilon-approximations.	SCG	2007	DBLP DOI BibTeX RDF	approximate range queries, epsilon-approximations, partition trees, range spaces, queries, discrepancy, range, VC-dimension, halfspaces
41	Stefan Langerman	On the Complexity of Halfspace Area Queries.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
41	Suzanne F. Buchele, Richard H. Crawford	Three-dimensional halfspace constructive solid geometry tree construction from implicit boundary representations.	Symposium on Solid Modeling and Applications	2003	DBLP DOI BibTeX RDF	product and assembly modeling, representation conversion, reverse engineering, geometric and topological representations
41	Stefan Langerman	On the complexity of halfspace area queries.	SCG	2001	DBLP DOI BibTeX RDF
41	Timothy M. Chan	Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions.	FOCS	1998	DBLP DOI BibTeX RDF
41	Bernard Chazelle, Franco P. Preparata	Halfspace range search: an algorithmic application of K-sets.	SCG	1985	DBLP DOI BibTeX RDF
33	Peyman Afshani, Chris H. Hamilton, Norbert Zeh	A general approach for cache-oblivious range reporting and approximate range counting.	SCG	2009	DBLP DOI BibTeX RDF	data structures, memory hierarchies, range searching, cache-obliviousness
33	Avrim Blum, Katrina Ligett, Aaron Roth 0001	A learning theory approach to non-interactive database privacy.	STOC	2008	DBLP DOI BibTeX RDF	non-interactive database privacy, learning theory
33	Colin N. Jones, Jan M. Maciejowski	Primal-Dual Enumeration for Multiparametric Linear Programming.	ICMS	2006	DBLP DOI BibTeX RDF
33	David Bremner, Komei Fukuda, Ambros Marzetta	Primal - Dual Methods for Vertex and Facet Enumeration.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
26	Parikshit Gopalan, Ryan O'Donnell, Yi Wu 0002, David Zuckerman	Fooling Functions of Halfspaces under Product Distributions.	CCC	2010	DBLP DOI BibTeX RDF	Pseudorandness, complexity theory, halfspace
26	Adam R. Klivans, Alexander A. Sherstov	Unconditional lower bounds for learning intersections of halfspaces.	Mach. Learn.	2007	DBLP DOI BibTeX RDF	Intersections of halfspaces, Halfspace learning, SQ learning, Lower bounds for learning, Harmonic sieve, PAC learning, Query learning, Statistical queries, Polynomial threshold functions
26	C. Bradford Barber, David P. Dobkin, Hannu Huhdanpaa	The Quickhull Algorithm for Convex Hulls.	ACM Trans. Math. Softw.	1996	DBLP DOI BibTeX RDF	halfspace intersection, Voronoi diagram, Delaunay triangulation, convex hull
26	Glenn Davis	Computing separating planes for pairs of disjoint polytopes.	SCG	1985	DBLP DOI BibTeX RDF	extreme halfspace, extreme plane, separating plane, convex hull, polytope, projective transformation, hidden surface elimination
25	Marine Picot, Federica Granese, Guillaume Staerman, Marco Romanelli 0002, Francisco Messina, Pablo Piantanida, Pierre Colombo	A Halfspace-Mass Depth-Based Method for Adversarial Attack Detection.	Trans. Mach. Learn. Res.	2023	DBLP BibTeX RDF
25	Xinyuan Cao, Santosh S. Vempala	Contrastive Moments: Unsupervised Halfspace Learning in Polynomial Time.	CoRR	2023	DBLP DOI BibTeX RDF
25	Amitabh Basu, Hongyi Jiang	Two-halfspace closure.	Math. Program.	2023	DBLP DOI BibTeX RDF
25	Xinyuan Cao, Santosh S. Vempala	Contrastive Moments: Unsupervised Halfspace Learning in Polynomial Time.	NeurIPS	2023	DBLP BibTeX RDF
25	Ilias Diakonikolas, Christos Tzamos, Daniel M. Kane	A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning.	STOC	2023	DBLP DOI BibTeX RDF
25	Ilias Diakonikolas, Christos Tzamos, Daniel Kane 0001	A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning.	Electron. Colloquium Comput. Complex.	2022	DBLP BibTeX RDF
25	Hao-Xiang Guo, Yang Liu 0014, Hao Pan, Baining Guo	Implicit Conversion of Manifold B-Rep Solids by Neural Halfspace Representation.	CoRR	2022	DBLP DOI BibTeX RDF
25	Ilias Diakonikolas, Christos Tzamos, Daniel M. Kane	A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning.	CoRR	2022	DBLP DOI BibTeX RDF
25	Hao-Xiang Guo, Yang Liu 0014, Hao Pan, Baining Guo	Implicit Conversion of Manifold B-Rep Solids by Neural Halfspace Representation.	ACM Trans. Graph.	2022	DBLP DOI BibTeX RDF
25	Rohan Ghuge, Anupam Gupta 0001, Viswanath Nagarajan	Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation.	IPCO	2022	DBLP DOI BibTeX RDF
25	Alexander A. Sherstov	The hardest halfspace.	Comput. Complex.	2021	DBLP DOI BibTeX RDF
25	Wenchao Yi, Liang Gao 0001, Zhi Pei, Jiansha Lu, Yong Chen	ε Constrained differential evolution using halfspace partition for optimization problems.	J. Intell. Manuf.	2021	DBLP DOI BibTeX RDF
25	Rohan Ghuge, Anupam Gupta 0001, Viswanath Nagarajan	Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation.	CoRR	2021	DBLP BibTeX RDF
25	Michael Matheny, Jeff M. Phillips	Approximate Maximum Halfspace Discrepancy.	CoRR	2021	DBLP BibTeX RDF
25	Petra Laketa, Stanislav Nagy	Reconstruction of atomic measures from their halfspace depth.	J. Multivar. Anal.	2021	DBLP DOI BibTeX RDF
25	Michael Matheny, Jeff M. Phillips	Approximate Maximum Halfspace Discrepancy.	ISAAC	2021	DBLP DOI BibTeX RDF
25	Wei Shao, Yijun Zuo	Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm.	Comput. Stat.	2020	DBLP DOI BibTeX RDF
25	Ata Kabán, Robert J. Durrant	Structure from Randomness in Halfspace Learning with the Zero-One Loss.	J. Artif. Intell. Res.	2020	DBLP DOI BibTeX RDF
25	Akash Kumar 0006, Adish Singla, Yisong Yue, Yuxin Chen 0001	Average-case Complexity of Teaching Convex Polytopes via Halfspace Queries.	CoRR	2020	DBLP BibTeX RDF
25	Yijun Zuo	A new approach for the computation of halfspace depth in high dimensions.	Commun. Stat. Simul. Comput.	2019	DBLP DOI BibTeX RDF
25	Alexander A. Sherstov	The hardest halfspace.	Electron. Colloquium Comput. Complex.	2019	DBLP BibTeX RDF
25	Alexander A. Sherstov	The Hardest Halfspace.	CoRR	2019	DBLP BibTeX RDF
25	Ei Ando, Shoichi Tsuchiya	The Volume of a Crosspolytope Truncated by a Halfspace.	TAMC	2019	DBLP DOI BibTeX RDF
25	Michael Matheny, Jeff M. Phillips	Practical Low-Dimensional Halfspace Range Space Sampling.	CoRR	2018	DBLP BibTeX RDF
25	Anne-Sophie Bonnet-Ben Dhia, Sonia Fliss, Antoine Tonnoir	The halfspace matching method: A new method to solve scattering problems in infinite media.	J. Comput. Appl. Math.	2018	DBLP DOI BibTeX RDF
25	Michael Matheny, Jeff M. Phillips	Practical Low-Dimensional Halfspace Range Space Sampling.	ESA	2018	DBLP DOI BibTeX RDF
25	Lukás Kotík, Daniel Hlubinka	A weighted localization of halfspace depth and its properties.	J. Multivar. Anal.	2017	DBLP DOI BibTeX RDF
25	Ngoc Anh Nguyen, Sorin Olaru, Pedro Rodríguez-Ayerbe, Martin Gulan	Construction of convex liftings based on halfspace representation.	ACC	2017	DBLP DOI BibTeX RDF
25	Chin How Jeffrey Pang	The Supporting Halfspace-Quadratic Programming Strategy for the Dual of the Best Approximation Problem.	SIAM J. Optim.	2016	DBLP DOI BibTeX RDF
25	Rainer Dyckerhoff, Pavlo Mozharovskyi	Exact computation of the halfspace depth.	Comput. Stat. Data Anal.	2016	DBLP DOI BibTeX RDF
25	Michael A. Burr, Robert Fabrizio	Error Probabilities for Halfspace Depth.	CoRR	2016	DBLP BibTeX RDF
25	Xiaohui Liu, Haiping Ren, Guofu Wang	Computing halfspace depth contours based on the idea of a circular sequence.	J. Syst. Sci. Complex.	2015	DBLP DOI BibTeX RDF
25	Xiaohui Liu, Yijun Zuo	Computing Halfspace Depth and Regression Depth.	Commun. Stat. Simul. Comput.	2014	DBLP DOI BibTeX RDF
25	Chun-Kit Au, Ho-fung Leung	Halfspace sampling in evolution strategies.	GECCO	2014	DBLP DOI BibTeX RDF
25	Djordje Baljozovic, Branko D. Kovacevic, Aleksandra Baljozovic	Mixed noise removal filter for multi-channel images based on halfspace deepest location.	IET Image Process.	2013	DBLP DOI BibTeX RDF
25	David Eppstein, Maarten Löffler	Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension.	Discret. Comput. Geom.	2013	DBLP DOI BibTeX RDF
25	Min Li	Modified Halfspace-Relaxation Projection Methods for Solving the Split Feasibility Problem.	Adv. Oper. Res.	2012	DBLP DOI BibTeX RDF
25	S. Muthukrishnan 0001, Aleksandar Nikolov	Optimal Private Halfspace Counting via Discrepancy	CoRR	2012	DBLP BibTeX RDF
25	Sunil Arya, David M. Mount, Jian Xia	Tight Lower Bounds for Halfspace Range Searching.	Discret. Comput. Geom.	2012	DBLP DOI BibTeX RDF
25	S. Muthukrishnan 0001, Aleksandar Nikolov	Optimal private halfspace counting via discrepancy.	STOC	2012	DBLP DOI BibTeX RDF
25	David Eppstein, Maarten Löffler	Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension	CoRR	2011	DBLP BibTeX RDF
25	Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis	Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition.	SODA	2011	DBLP DOI BibTeX RDF
25	David Eppstein, Maarten Löffler	Bounds on the complexity of halfspace intersections when the bounded faces have small dimension.	SCG	2011	DBLP DOI BibTeX RDF
25	Daniel Hlubinka, Ondrej Vencálek, Lukás Kotík	Weighted halfspace depth.	Kybernetika	2010	DBLP BibTeX RDF
25	Boris Aronov, Micha Sharir	Approximate Halfspace Range Counting.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
25	David Bremner, Dan Chen 0003	A Branch and Cut Algorithm for the Halfspace Depth Problem	CoRR	2009	DBLP BibTeX RDF
25	Klaus Truemper	Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization.	MLDM	2009	DBLP DOI BibTeX RDF	Reliability, Logic, Discretization, Explanation, Comprehensibility
25	Emilio Carrizosa, Frank Plastria	Optimal Expected-Distance Separating Halfspace.	Math. Oper. Res.	2008	DBLP DOI BibTeX RDF
25	Dan Chen	A Branch and Cut Algorithm for the Halfspace Depth Problem	CoRR	2007	DBLP BibTeX RDF
25	Eric Lengyel	Unified Distance Formulas for Halfspace Fog.	J. Graph. Tools	2007	DBLP DOI BibTeX RDF
25	Suzanne F. Buchele, Richard H. Crawford	Three-dimensional halfspace constructive solid geometry tree construction from implicit boundary representations.	Comput. Aided Des.	2004	DBLP DOI BibTeX RDF
25	Erik D. Demaine, Jeff Erickson 0001, Stefan Langerman	On the Complexity of Halfspace Volume Queries.	CCCG	2003	DBLP BibTeX RDF
25	Timothy M. Chan	Random Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions.	SIAM J. Comput.	2000	DBLP DOI BibTeX RDF
25	Norbert Geng, Marc A. Ressler, Lawrence Carin	Wide-band VHF scattering from a trihedral reflector situated above a lossy dispersive halfspace.	IEEE Trans. Geosci. Remote. Sens.	1999	DBLP DOI BibTeX RDF
25	Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid	Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems.	Comput. Geom.	1996	DBLP DOI BibTeX RDF
25	Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid	Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems.	Comput. Geom.	1995	DBLP DOI BibTeX RDF
25	Edward R. Scheinerman, Ann N. Trenk, Daniel Ullman 0001	On point-halfspace graphs.	J. Graph Theory	1995	DBLP DOI BibTeX RDF
25	Philip M. Long	Halfspace Learning, Linear Programming, and Nonmalicious Distributions.	Inf. Process. Lett.	1994	DBLP DOI BibTeX RDF
25	Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman	Characterization and Recognition of Point-Halfspace and Related Orders.	GD	1994	DBLP DOI BibTeX RDF
25	Bernard Chazelle, Franco P. Preparata	Halfspace Range Search: An Algorithmic Application of k-Sets.	Discret. Comput. Geom.	1986	DBLP DOI BibTeX RDF
16	Cheng Sheng 0001, Yufei Tao 0001	FIFO indexes for decomposable problems.	PODS	2011	DBLP DOI BibTeX RDF
16	Peyman Afshani, Timothy M. Chan	On Approximate Range Counting and Depth.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Statistical depth, Approximation algorithms, Data structures, Randomized algorithms, Range searching
16	Khaled M. Elbassioni, Hans Raj Tiwary	Complexity of Approximating the Vertex Centroid of a Polyhedron.	ISAAC	2009	DBLP DOI BibTeX RDF
16	Parikshit Gopalan, Jaikumar Radhakrishnan	Finding duplicates in a data stream.	SODA	2009	DBLP DOI BibTeX RDF
16	Bernard Chazelle, Wolfgang Mulzer	Computing hereditary convex structures.	SCG	2009	DBLP DOI BibTeX RDF	half-space range searching, hereditary convex hulls, convex polytope
16	Peyman Afshani, Chris H. Hamilton, Norbert Zeh	Cache-oblivious range reporting with optimal queries requires superlinear space.	SCG	2009	DBLP DOI BibTeX RDF	data structures, lower bounds, memory hierarchies, range searching, cache-obliviousness
16	Pankaj K. Agarwal, Micha Sharir, Emo Welzl	Algorithms for center and Tverberg points.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Tverberg point, center point, Arrangements
16	Konstantinos Slavakis, Sergios Theodoridis, Isao Yamada	Online Kernel-Based Classification Using Adaptive Projection Algorithms.	IEEE Trans. Signal Process.	2008	DBLP DOI BibTeX RDF
16	Imre Bárány, Alfredo Hubard, Jesús Jerónimo	Slicing Convex Sets and Measures by a Hyperplane.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Well separated families, Sections of convex sets and measures, Convex bodies
16	S. Charles Brubaker, Santosh S. Vempala	Isotropic PCA and Affine-Invariant Clustering.	FOCS	2008	DBLP DOI BibTeX RDF
16	Peyman Afshani, Timothy M. Chan	On approximate range counting and depth.	SCG	2007	DBLP DOI BibTeX RDF	data depth, computational geometry, approximation, approximate counting
16	Guilherme Dias da Fonseca	Approximate Range Searching: The Absolute Model.	WADS	2007	DBLP DOI BibTeX RDF