Subhash Suri
Subhash Suri

homepage
suriatcs.ucsb.edu

ACM Fellow badge
  Affiliation history
Bibliometrics: publication history
Average citations per article13.78
Citation Count2,659
Publication count193
Publication years1985-2017
Available for download84
Average downloads per article595.77
Downloads (cumulative)50,045
Downloads (12 Months)1,304
Downloads (6 Weeks)192
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Advisor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


194 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 194
Result page: 1 2 3 4 5 6 7 8 9 10

Sort by:

1
June 2018 Journal of Computer and System Sciences: Volume 94 Issue C, June 2018
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

Let P be a set of n uncertain points in Rd, where each point piP is associated with a real value vi and exists with probability i(0,1] independently of the other points. We present algorithms for building an index on P so that for a d-dimensional query rectangle , the ...
Keywords: Range-max queries, Skylines, Algorithms, Lower bounds, Orthogonal query ranges, Data structures, Data uncertainty

2
October 2017 Algorithmica: Volume 79 Issue 2, October 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our framework, the uncertainty of each input point is described by a probability distribution over a finite number of possible ...
Keywords: Tukey depth, Convex hull, Membership probability, Uncertainty

3
October 2016 Algorithmica: Volume 76 Issue 2, October 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We consider a graph observability problem: how many edge colors are needed for an unlabeled graph so that an agent, walking from node to node, can uniquely determine its location from just the observed color sequence of the walk? Specifically, let G(n, d) be an edge-colored subgraph of d-dimensional (directed ...
Keywords: Lattice graphs, Edge coloring, Graph observability, Orthogonal arrays

4 published by ACM
June 2016 PODS '16: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 11,   Downloads (12 Months): 98,   Downloads (Overall): 282

Full text available: PDFPDF
Let P be a set of n uncertain points in Re d , where each point p i ∈ P is associated with a real value v i and a probability α i ∈ (0,1] of existence, i.e., each p i exists with an independent probability α i . We ...
Keywords: algorithms, data structures, data uncertainty, lower bounds, orthogonal query ranges, range-max queries, skylines

5
December 2015 Algorithmica: Volume 73 Issue 4, December 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We consider the following variant of a classical pursuit-evasion problem: how many pursuers are needed to capture a single (adversarial) evader on a closed polyhedral surface in three dimensions? The players move on the polyhedral surface, have the same maximum speed, and are always aware of each others' current positions. ...
Keywords: Polyhedral surface, Weighted surfaces, Lion and man game, Shortest path

6 published by ACM
November 2015 SIGSPATIAL '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 25,   Downloads (Overall): 64

Full text available: PDFPDF
We propose an efficient algorithm for discovering the high-level topological structure of a collection of 3-dimensional trajectories. Our algorithm computes a sparse graph representing the latent "bundling" and "unbundling" structure of the trajectory data. Our motivation stems from the emerging area of brain tractography , which aims to construct the ...
Keywords: computational geometry

7
February 2015 Algorithmica: Volume 71 Issue 2, February 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

A well-known problem in computational geometry is Klee's measure problem, which asks for the volume of a union of axis-aligned boxes in d -space. In this paper, we consider Klee's measure problem for the special case where a 2-dimensional orthogonal projection of all the boxes has a common corner. We ...
Keywords: Grounded boxes, Hypervolume indicator, Weighted volume, Klee's measure, Sum of ordered products

8
January 2015 SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 30,   Downloads (Overall): 75

Full text available: PDFPDF
We consider the problem of computing k shortest paths in a two-dimensional environment with polygonal obstacles, where the j th path, for 1 ≤ j ≤ k , is the shortest path in the free space that is also homotopically distinct from each of the first j − 1 paths. ...

9 published by ACM
June 2014 SOCG'14: Proceedings of the thirtieth annual symposium on Computational geometry
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 5,   Downloads (12 Months): 21,   Downloads (Overall): 127

Full text available: PDFPDF
We consider the problem of embedding an undirected graph into hyperbolic space with minimum distortion. A fundamental problem in its own right, it has also drawn a great deal of interest from applied communities interested in empirical analysis of large-scale graphs. In this paper, we establish a connection between distortion ...

10
February 2014 Theoretical Computer Science: Volume 522, February, 2014
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

We consider the following generalization of the classical pursuit-evasion problem, which we call k-capture. A group of n pursuers (hyenas) wish to capture an evader (lion) who is free to move in an m-dimensional Euclidean space, the pursuers and the evader can move with the same maximum speed, and at ...
Keywords: Convex hull, Multiagent systems, Pursuit-evasion games, k-Hull, Algorithms

11
February 2014 Computational Geometry: Theory and Applications: Volume 47 Issue 2, February, 2014
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

Given a (master) set M of n points in d-dimensional Euclidean space, consider drawing a random subset that includes each point m"[email protected]?M with an independent probability p"i. How difficult is it to compute elementary statistics about the closest pair of points in such a subset? For instance, what is the ...
Keywords: Approximation algorithms, Computational geometry, Data structures, Probabilistic optimization

12 published by ACM
June 2013 SoCG '13: Proceedings of the twenty-ninth annual symposium on Computational geometry
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Downloads (Overall): 60

Full text available: PDFPDF
We investigate the following problem in the visibility-based discrete-time model of pursuit evasion in the plane: how many pursuers are needed to capture an evader in a polygonal environment with obstacles under the minimalist assumption that pursuers and the evader have the same maximum speed? When the environment is a ...
Keywords: constrained delaunay triangulation, lion-and-man, lower bound, upper bound

13 published by ACM
June 2013 SoCG '13: Proceedings of the twenty-ninth annual symposium on Computational geometry
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 4,   Downloads (12 Months): 20,   Downloads (Overall): 144

Full text available: PDFPDF
We propose an algorithm for the problem of computing shortest paths among curved obstacles in the plane. If the obstacles have O(n) description complexity, then the algorithm runs in O(n log n) time plus a term dependent on the properties of the boundary arcs. Specifically, if the arcs allow a ...
Keywords: continuous dijkstra, curved obstacles, polygonization, shortest paths

14
January 2013 Proceedings of the VLDB Endowment: Volume 6 Issue 3, January 2013
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Downloads (Overall): 124

Full text available: PDFPDF
Massively parallel DNA sequencing technologies are revolutionizing genomics research. Billions of short reads generated at low costs can be assembled for reconstructing the whole genomes. Unfortunately, the large memory footprint of the existing de novo assembly algorithms makes it challenging to get the assembly done for higher eukaryotes like mammals. ...

15
September 2012 International Journal of Robotics Research: Volume 31 Issue 10, September 2012
Publisher: Sage Publications, Inc.
Bibliometrics:
Citation Count: 8

Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. How many pursuers, each with the same maximum speed as the evader, are necessary and sufficient to guarantee a successful capture of the evader? The pursuers always know ...
Keywords: Path planning for multiple mobile robot systems, mobile and distributed robotics SLAM sensor networks, sensing and perception computer vision, pursuit evasion games, sensing and perception computer vision surveillance systems

16
July 2012 AAAI'12: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

We resolve a several-years old open question in visibility-based pursuit evasion: how many pursuers are needed to capture an evader in an arbitrary polygonal environment with obstacles? The evader is assumed to be adversarial, moves with the same maximum speed as pursuers, and is "sensed" by a pursuer only when ...

17 published by ACM
June 2012 SoCG '12: Proceedings of the twenty-eighth annual symposium on Computational geometry
Publisher: ACM
Bibliometrics:
Citation Count: 10
Downloads (6 Weeks): 2,   Downloads (12 Months): 4,   Downloads (Overall): 118

Full text available: PDFPDF
A well-known problem in computational geometry is Klee's measure problem, which asks for the volume of a union of axis-aligned boxes in d-space. In this paper, we consider Klee's measure problem for the special case where a 2-dimensional orthogonal projection of all the boxes has a common corner. We call ...
Keywords: hypervolume indicator, weighted volume, Klee's measure, grounded boxes, sum of ordered products

18
September 2011 ESA'11: Proceedings of the 19th European conference on Algorithms
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Suppose we have a set of n axis-aligned rectangular boxes in d -space, { B 1 , B 2 , ..., B n }, where each box B i is active (or present) with an independent probability p i . We wish to compute the expected volume occupied by the ...

19
August 2011 WADS'11: Proceedings of the 12th international conference on Algorithms and data structures
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

Given a (master) set M of n points in d -dimensional Euclidean space, consider drawing a random subset that includes each point m i ∈ M with an independent probability p i . How difficult is it to compute elementary statistics about the closest pair of points in such a ...

20
August 2011 AAAI'11: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. How many pursuers, each with the same maximum speed as the evader, are necessary and sufficient to guarantee a successful capture of the evader? The pursuers always know ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us