Sciweavers

1154 search results - page 194 / 231
» On the editing distance of graphs
Sort
View
DAC
2006
ACM
14 years 9 months ago
Architecture-aware FPGA placement using metric embedding
Since performance on FPGAs is dominated by the routing architecture rather than wirelength, we propose a new architecture-aware approach to initial FPGA placement that models the ...
Padmini Gopalakrishnan, Xin Li, Lawrence T. Pilegg...
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
14 years 9 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
FOCS
2009
IEEE
14 years 3 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer
ICRA
2009
IEEE
107views Robotics» more  ICRA 2009»
14 years 3 months ago
Graph-based planning using local information for unknown outdoor environments
— One of the common applications for outdoor robots is to follow a path in large scale unknown environments. This task is challenging due to the intensive memory requirements to ...
Jinhan Lee, Roozbeh Mottaghi, Charles Pippin, Tuck...
WAW
2009
Springer
147views Algorithms» more  WAW 2009»
14 years 3 months ago
A Dynamic Model for On-Line Social Networks
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat...