2366 search results - page 246 / 474 » Mapping time |
116
click to vote
ANLP
2000
15 years 5 months ago
2000
This paper compares the efficiency of using a standard direct-manipulation graphical user interface (GUI) with that of using the QuickSet pen/voice multimodal interface for suppor...
145
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
144
click to vote
GLVLSI
2010
IEEE
15 years 4 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
131
click to vote
ALGORITHMICA
2007
15 years 4 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
119
Voted
ALGORITHMICA
2005
15 years 4 months ago
2005
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...