Sciweavers

178 search results - page 25 / 36
» Computing Longest Previous Factor in linear time and applica...
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
CPM
2007
Springer
115views Combinatorics» more  CPM 2007»
14 years 2 months ago
Two-Dimensional Range Minimum Queries
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is t...
Amihood Amir, Johannes Fischer, Moshe Lewenstein
AVI
2006
13 years 10 months ago
An integrated task-based framework for the design and evaluation of visualizations to support preferential choice
In previous work, we proposed ValueCharts, a set of visualizations and interactive techniques to support the inspection of linear models of preferences. We now identify the need t...
Jeanette Bautista, Giuseppe Carenini
SAC
2010
ACM
14 years 3 months ago
Spanders: distributed spanning expanders
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
Shlomi Dolev, Nir Tzachar
ISCA
1992
IEEE
123views Hardware» more  ISCA 1992»
14 years 16 days ago
The Impact of Communication Locality on Large-Scale Multiprocessor Performance
As multiprocessor sizes scale and computer architects turn to interconnection networks with non-uniform communication latencies, the lure of exploiting communication locality to i...
Kirk L. Johnson