Sciweavers

9842 search results - page 1664 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
P2P
2007
IEEE
113views Communications» more  P2P 2007»
15 years 11 months ago
Handling Network Partitions and Mergers in Structured Overlay Networks
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...
Tallat M. Shafaat, Ali Ghodsi, Seif Haridi
SP
2007
IEEE
108views Security Privacy» more  SP 2007»
15 years 11 months ago
Trojan Detection using IC Fingerprinting
Hardware manufacturers are increasingly outsourcing their IC fabrication work overseas due to much lower costs. This poses a significant security risk for ICs used for critical m...
Dakshi Agrawal, Selçuk Baktir, Deniz Karako...
ALT
2007
Springer
15 years 11 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud
CCS
2007
ACM
15 years 11 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
NETCOOP
2007
Springer
15 years 10 months ago
How Expensive Is Link Utilization?
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in unde...
Rade Stanojevic, Robert Shorten
« Prev « First page 1664 / 1969 Last » Next »