1623 search results - page 186 / 325 » No Sorting |
192
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
174
click to vote
CONTEXT
1999
Springer
15 years 10 months ago
1999
Springer
When modelling complex systems one can not include all the causal factors, but one has to settle for partial models. This is alright if the factors left out are either so constant...
170
click to vote
SPAA
1997
ACM
15 years 10 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
194
click to vote
AVI
2006
15 years 7 months ago
2006
Scientific measurements are often depicted as line graphs. Stateof-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundred...
173
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...