1078 search results - page 215 / 216 » Analyzing DB2 Data Sharing Performance Problems |
AAAI
2010
13 years 9 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...
DAGSTUHL
2007
13 years 9 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...
NIPS
2001
13 years 9 months ago
2001
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
WSC
2004
13 years 9 months ago
2004
This paper describes an algorithm for approximating missing data in air traffic routes thereby allowing the lengths of different routes to be compared for our simulation analyses....
BMCBI
2010
13 years 7 months ago
2010
Background: In a time-course microarray experiment, the expression level for each gene is observed across a number of time-points in order to characterize the temporal trajectorie...