233 search results - page 33 / 47 » Flows on Few Paths: Algorithms and Lower Bounds |
120
click to vote
TCC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
108
Voted
ISPAN
2000
IEEE
15 years 4 months ago
2000
IEEE
We present new architectural concepts for uniprocessor designs that conform to the data-driven computation paradigm. Usage of our D2 -CPU (Data-Driven processor) follows the natura...
117
Voted
WCE
2007
15 years 1 months ago
2007
—Ad hoc networking will become a major technology for wireless connectivity beside the multimedia necessity within the next few years. There are too many applications where one-t...
189
click to vote
STOC
1993
ACM
15 years 4 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
CIC
2004
15 years 1 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...