12453 search results - page 2442 / 2491 » Concurrent Data Structures |
APPROX
2010
Springer
15 years 3 months 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...
117
click to vote
AAAI
2010
15 years 3 months 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...
138
click to vote
DAGSTUHL
2007
15 years 3 months 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...
LREC
2010
15 years 3 months 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...
LREC
2010
15 years 3 months ago
2010
This paper presents the rationale, objectives and advances of an on-going project (the DesPho-APaDy project funded by the French National Agency of Research) which aims to provide...