ROLE
BOOKMARK & SHARE


Result page:
1
2
3
4
5
6
7
8
9
10
1
June 2018
Journal of Computer and System Sciences: Volume 94 Issue C, June 2018
Publisher: Academic Press, Inc.
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 ddimensional query rectangle , the ...
Keywords:
Rangemax queries, Skylines, Algorithms, Lower bounds, Orthogonal query ranges, Data structures, Data uncertainty
2
October 2017
Algorithmica: Volume 79 Issue 2, October 2017
Publisher: SpringerVerlag New York, Inc.
We study the convexhull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, locationbased 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: SpringerVerlag New York, Inc.
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 edgecolored subgraph of ddimensional (directed ...
Keywords:
Lattice graphs, Edge coloring, Graph observability, Orthogonal arrays
4
June 2016
PODS '16: Proceedings of the 35th ACM SIGMODSIGACTSIGAI 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:
PDF
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, rangemax queries, skylines
5
December 2015
Algorithmica: Volume 73 Issue 4, December 2015
Publisher: SpringerVerlag New York, Inc.
We consider the following variant of a classical pursuitevasion 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
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:
PDF
We propose an efficient algorithm for discovering the highlevel topological structure of a collection of 3dimensional 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: SpringerVerlag New York, Inc.
A wellknown problem in computational geometry is Klee's measure problem, which asks for the volume of a union of axisaligned boxes in d space. In this paper, we consider Klee's measure problem for the special case where a 2dimensional 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 twentysixth annual ACMSIAM 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:
PDF
We consider the problem of computing k shortest paths in a twodimensional 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
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:
PDF
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 largescale 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.
We consider the following generalization of the classical pursuitevasion problem, which we call kcapture. A group of n pursuers (hyenas) wish to capture an evader (lion) who is free to move in an mdimensional Euclidean space, the pursuers and the evader can move with the same maximum speed, and at ...
Keywords:
Convex hull, Multiagent systems, Pursuitevasion games, kHull, Algorithms
11
February 2014
Computational Geometry: Theory and Applications: Volume 47 Issue 2, February, 2014
Publisher: Elsevier Science Publishers B. V.
Given a (master) set M of n points in ddimensional 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
June 2013
SoCG '13: Proceedings of the twentyninth 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:
PDF
We investigate the following problem in the visibilitybased discretetime 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, lionandman, lower bound, upper bound
13
June 2013
SoCG '13: Proceedings of the twentyninth 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:
PDF
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:
PDF
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.
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 TwentySixth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
We resolve a severalyears old open question in visibilitybased 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
June 2012
SoCG '12: Proceedings of the twentyeighth 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:
PDF
A wellknown problem in computational geometry is Klee's measure problem, which asks for the volume of a union of axisaligned boxes in dspace. In this paper, we consider Klee's measure problem for the special case where a 2dimensional 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: SpringerVerlag
Suppose we have a set of n axisaligned 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: SpringerVerlag
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 TwentyFifth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
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 ...

