Sciweavers

1969 search results - page 201 / 394
» Financial Theory 1
Sort
View
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 7 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
DCC
2007
IEEE
16 years 6 months ago
A sequence approach to linear perfect hash families
A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of order q consists of a set S = {1, . . . , s} of linear functionals from V to F ...
Susan G. Barwick, Wen-Ai Jackson
ICCAD
2002
IEEE
104views Hardware» more  ICCAD 2002»
16 years 3 months ago
A new enhanced SPFD rewiring algorithm
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
Jason Cong, Joey Y. Lin, Wangning Long
LATA
2009
Springer
16 years 1 months ago
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...
Nutan Limaye, Meena Mahajan
FOCS
2009
IEEE
16 years 1 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