5606 search results - page 354 / 1122 » Randomization Techniques for Graphs. |
181
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
210
click to vote
GRAPHICSINTERFACE
2011
14 years 10 months ago
2011
People generally remember locations in visual spaces with respect to spatial features and landmarks. Geographical maps provide many spatial features and hence are easy to remember...
163
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
This paper presents efficient automatic code synthesis techniques from dataflow graphs for multimedia applications. Since multimedia applications require large size buffers contai...
183
click to vote
TPHOL
2008
IEEE
16 years 1 months ago
2008
IEEE
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
188
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
Trends in the semiconductor industry towards extensive design and code reuse motivate a need for adequate Intellectual Property Protection (IPP) schemes. We offer a new general IP...