2016 search results - page 83 / 404 » Megamaps: Construction and Examples |
124
click to vote
JCT
2011
14 years 11 months ago
2011
The descendant set desc(α) of a vertex α in a digraph D is the set of vertices which can be reached by a directed path from α. A subdigraph of D is finitely generated if it is...
139
click to vote
EUROCRYPT
2007
Springer
15 years 10 months ago
2007
Springer
We investigate a general class of (black-box) constructions for range extension of weak pseudorandom functions: a construction based on m independent functions F1, . . . , Fm is gi...
144
click to vote
IEEEPACT
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper, we study the effects of manipulating the architected direction of conditional branches. Through the use of statistical sampling, we find that about 40% of all dyna...
151
click to vote
DCOSS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
142
click to vote
CORR
2012
Springer
14 years 11 days ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...