Sciweavers

2304 search results - page 137 / 461
» On the Vulnerability of Large Graphs
Sort
View
DSN
2008
IEEE
15 years 8 months ago
An accurate flip-flop selection technique for reducing logic SER
The combination of continued technology scaling and increased on-chip transistor densities has made vulnerability to radiation induced soft errors a significant design concern. In...
Eric L. Hill, Mikko H. Lipasti, Kewal K. Saluja
114
Voted
CJ
1998
63views more  CJ 1998»
15 years 5 months ago
Protecting IT Systems from Cyber Crime
Large-scale commercial, industrial and financial operations are becoming ever more interdependent, and ever more dependent on IT. At the same time, the rapidly growing interconnec...
R. Benjamin, B. Gladman, Brian Randell
CN
2010
83views more  CN 2010»
15 years 5 months ago
Secure peer sampling
PuppetCast is a protocol for secure peer sampling in large-scale distributed systems. A peer sampling protocol continuously provides each node in the system with a uniform random ...
Gian Paolo Jesi, Alberto Montresor, Maarten van St...
DAM
2007
81views more  DAM 2007»
15 years 6 months ago
Graphs, partitions and Fibonacci numbers
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
Arnold Knopfmacher, Robert F. Tichy, Stephan Wagne...
MICCAI
2006
Springer
16 years 7 months ago
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...
Ali Kemal Sinop, Leo Grady