|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 31 occurrences of 21 keywords
|
|
|
|
|
Results
Found 41 publication records. Showing 41 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sunil Arya, David M. Mount, Jian Xia |
Tight Lower Bounds for Halfspace Range Searching.  |
Discrete & Computational Geometry  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
Polytope approximation and the Mahler volume. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
Approximate polytope membership queries. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
A Unified Approach to Approximate Proximity Searching. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, David M. Mount, Jian Xia |
Tight lower bounds for halfspace range searching. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
lower bounds, range searching, idempotence |
| 1 | Sunil Arya, Theocharis Malamatos, David M. Mount |
Space-time tradeoffs for approximate nearest neighbor searching. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Theocharis Malamatos, David M. Mount |
The Effect of Corners on the Complexity of Approximate Range Searching. |
Discrete & Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
Computational complexity, Approximation algorithms, Range searching, Idempotence |
| 1 | Sunil Arya, David M. Mount, Antoine Vigneron, Jian Xia |
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
Tradeoffs in Approximate Range Searching Made Simpler. |
SIBGRAPI |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Theocharis Malamatos, David M. Mount |
A simple entropy-based algorithm for planar point location. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
expected-case complexity, polygonal subdivision, trapezoidal maps, entropy, randomized algorithms, Point location |
| 1 | Sunil Arya, Theocharis Malamatos, David M. Mount, Ka Chun Wong |
Optimal Expected-Case Planar Point Location. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Theocharis Malamatos, David M. Mount |
The effect of corners on the complexity of approximate range searching. |
Symposium on Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, range searching, idempotence |
| 1 | Sunil Arya, Theocharis Malamatos, David M. Mount |
On the importance of idempotence. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, range searching, idempotence |
| 1 | Sunil Arya, Theocharis Malamatos, David M. Mount |
Space-time tradeoffs for approximate spherical range counting. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Ho-Yam Addy Fu |
Expected-Case Complexity of Approximate Nearest Neighbor Searching. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya |
Binary space partitions for axis-parallel line segments: Size-height tradeoffs. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Theocharis Malamatos |
Linear-size approximate voronoi diagrams. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Theocharis Malamatos, David M. Mount |
Space-efficient approximate Voronoi diagrams. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Siu-Wing Cheng, David M. Mount |
Approximation Algorithm for Multiple-Tool Milling. |
Int. J. Comput. Geometry Appl. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Sunil Arya, Theocharis Malamatos, David M. Mount |
A simple entropy-based algorithm for planar point location. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Theocharis Malamatos, David M. Mount |
Entropy-preserving cuttings and space-efficient planar point location. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, David M. Mount |
Approximate range searching. |
Comput. Geom. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Ho-Yam Addy Fu |
Expected-case complexity of approximate nearest neighbor searching. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | V. S. Anil Kumar, Sunil Arya, H. Ramesh |
Hardness of Set Cover with Intersection 1. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan |
Efficient Expected-Case Algorithms for Planar Point Location. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Theocharis Malamatos, David M. Mount |
Nearly Optimal Expected-Case Planar Point Location. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
nearly optimal expected-case planar point location, expected search time, planar polygonal subdivision, search structure, optimal binary search tree, polygonal subdivision, polygonal cells, convex cells, data structure, computational geometry, probability, trees (mathematics), search problems, subdivision, planar point location |
| 1 | Sunil Arya, David M. Mount, Michiel H. M. Smid |
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. |
Comput. Geom. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, H. Ramesh |
A 2.5-Factor Approximation Algorithm for the k-MST Problem. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu |
An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. |
J. ACM |
1998 |
DBLP DOI BibTeX RDF |
box-decomposition trees, closet-point queries, post-office problem, priority search, approximation algorithms, nearest neighbor searching |
| 1 | Sunil Arya, Siu-Wing Cheng, David M. Mount |
Approximation Algorithms for Multiple-Tool Miling. |
Symposium on Computational Geometry |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Michiel H. M. Smid |
Efficient Construction of a Bounded-Degree Spanner with Low Weight. |
Algorithmica |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, David M. Mount, Onuttom Narayan |
Accounting for Boundary Effects in Nearest-Neighbor Searching. |
Discrete & Computational Geometry |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, David M. Mount |
Approximate Range Searching. |
Symposium on Computational Geometry |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, David M. Mount, Onuttom Narayan |
Accounting for Boundary Effects in Nearest Neighbor Searching. |
Symposium on Computational Geometry |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid |
Euclidean spanners: short, thin, and lanky. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Michiel H. M. Smid |
Efficient Construction of a Bounded Degree Spanner with Low Weight. |
ESA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu |
An Optimal Algorithm for Approximate Nearest Neighbor Searching. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, David M. Mount, Michiel H. M. Smid |
Randomized and deterministic algorithms for geometric spanners of small diameter |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
randomized algorithms, directed graph, deterministic algorithms, insertions, deletions, geometric spanners |
| 1 | Sunil Arya, David M. Mount |
Approximate Nearest Neighbor Queries in Fixed Dimensions. |
SODA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, David M. Mount |
Algorithms for Fast Vector Quantizaton. |
Data Compression Conference |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Daniel DeMenthon, Peter Meer, Larry S. Davis |
Textural analysis of range images. |
Pattern Recognition Letters |
1991 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #41 of 41 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")