Sciweavers

617 search results - page 99 / 124
» On the Chromatic Number of Random Graphs
Sort
View
VLSID
2006
IEEE
129views VLSI» more  VLSID 2006»
16 years 4 months ago
A Stimulus-Free Probabilistic Model for Single-Event-Upset Sensitivity
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
Mohammad Gh. Mohammad, Laila Terkawi, Muna Albasma...
132
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
Static and Dynamic Analysis of the Internet's Susceptibility to Faults and Attacks
— We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated dat...
Seung-Taek Park, Alexy Khrabrov, David M. Pennock,...
ICCV
2009
IEEE
16 years 9 months ago
Correlated Probabilistic Trajectories for Pedestrian Motion Detection
This paper introduces an algorithm for detecting walking motion using point trajectories in video sequences. Given a number of point trajectories, we identify those which are sp...
Frank Perbet, Atsuto Maki, Bjorn Stenger
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 4 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
IDEAL
2007
Springer
15 years 10 months ago
PINCoC : A Co-clustering Based Approach to Analyze Protein-Protein Interaction Networks
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
Clara Pizzuti, Simona E. Rombo