Sciweavers

851 search results - page 54 / 171
» Random constructions and density results
Sort
View
ICIP
2010
IEEE
14 years 8 months ago
Detecting pitching frames in baseball game video using Markov random walk
Pitching is the starting point of an event in baseball games. Hence, locating pitching shots is a critical step in content analysis of a baseball game video. However, pitching fra...
Chih-Yi Chiu, Po-Chih Lin, Wei-Ming Chang, Hsin-Mi...
SJ
2011
14 years 5 months ago
Analyzing the Resilience of Complex Supply Network Topologies Against Random and Targeted Disruptions
—In this paper, we study the resilience of supply networks against disruptions and provide insights to supply chain managers on how to construct a resilient supply network from t...
Kang Zhao, Akhil Kumar, Terry P. Harrison, John Ye...
MOBIHOC
2005
ACM
15 years 10 months ago
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
Rajagopal Iyengar, Koushik Kar, Suman Banerjee
CRYPTO
2003
Springer
109views Cryptology» more  CRYPTO 2003»
15 years 3 months ago
On Deniability in the Common Reference String and Random Oracle Model
We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntacticall...
Rafael Pass
FOCS
2008
IEEE
15 years 5 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...