Sciweavers

11214 search results - page 2206 / 2243
» Just-in-time data structures
Sort
View
DAS
2008
Springer
15 years 23 days ago
Towards Whole-Book Recognition
We describe experimental results for unsupervised recognition of the textual contents of book-images using fully automatic mutual-entropy-based model adaptation. Each experiment s...
Pingping Xiu, Henry S. Baird
ESWS
2008
Springer
15 years 22 days ago
Conceptual Spaces in ViCoS
We describe ViCoS, a tool for constructing and visualising conceptual spaces in the area of language documentation. ViCoS allows users to enrich existing lexical information about ...
Claus Zinn
ATMOS
2007
15 years 15 days ago
Maintenance of Multi-level Overlay Graphs for Timetable Queries
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...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 15 days ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
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...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
AAAI
2010
15 years 13 days ago
Multi-Agent Plan Recognition: Formalization and Algorithms
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...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
« Prev « First page 2206 / 2243 Last » Next »