11784 search results - page 2307 / 2357 » Interpolation for data structures |
96
Voted
ATMOS
2007
15 years 21 days ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
APPROX
2010
Springer
15 years 20 days ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
AAAI
2010
15 years 18 days ago
2010
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
113
click to vote
DAGSTUHL
2007
15 years 18 days ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
77
Voted
LREC
2010
15 years 18 days ago
2010
Investigating differences in linguistic usage between individuals who have suffered brain injury (hereafter patients) and those who haven't can yield a number of benefits. It...