Sciweavers

1664 search results - page 327 / 333
» Distance labeling in graphs
Sort
View
ALGORITHMICA
2011
14 years 4 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
13 years 9 days ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
GIS
2009
ACM
15 years 11 months ago
Map-Matching for Low-Sampling-Rate GPS Trajectories
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...
Yin Lou, Chengyang Zhang, Yu Zheng, Xing Xie, Wei ...
WWW
2004
ACM
15 years 10 months ago
Authoring of learning styles in adaptive hypermedia: problems and solutions
Learning styles, as well as the best ways of responding with corresponding instructional strategies, have been intensively studied in the classical educational (classroom) setting...
Natalia Stash, Alexandra I. Cristea, Paul De Bra
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
15 years 10 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami