2168 search results - page 381 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
126
Voted
CF
2004
ACM
15 years 9 months ago
2004
ACM
Next generation architectures will require innovative solutions to reduce energy consumption. One of the trends we expect is more extensive utilization of compiler information dir...
125
Voted
ISPD
2003
ACM
15 years 8 months ago
2003
ACM
In 21st-Century VLSI design, clocking plays crucial roles for both performance and timing convergence. Due to their non-convex nature, optimal minimum-delay/area zero-skew wire-si...
128
Voted
RIVF
2007
15 years 5 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
140
Voted
SIGCOMM
2010
ACM
15 years 3 months ago
2010
ACM
Networks continue to change to support new applications, improve reliability and performance and reduce the operational cost. The changes are made to the network in the form of up...
142
Voted
CIKM
2011
Springer
14 years 3 months ago
2011
Springer
We consider the problem of link prediction in signed networks. Such networks arise on the web in a variety of ways when users can implicitly or explicitly tag their relationship w...