Sciweavers

2661 search results - page 294 / 533
» Quantum Complexity Classes
Sort
View
INFOCOM
2009
IEEE
15 years 10 months ago
On Cooperative Wireless Network Secrecy
—Given that wireless communication occurs in a shared and inherently broadcast medium, the transmissions are vulnerable to undesired eavesdropping. This occurs even when a point-...
Etienne Perron, Suhas N. Diggavi, Emre Telatar
ACG
2009
Springer
15 years 10 months ago
Data Assurance in Opaque Computations
The chess endgame is increasingly being seen through the lens of, and therefore effectively defined by, a data ‘model’ of itself. It is vital that such models are clearly faith...
Joe Hurd, Guy Haworth
FM
2009
Springer
106views Formal Methods» more  FM 2009»
15 years 10 months ago
Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way
Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enabl...
Rik Eshuis
FSTTCS
2009
Springer
15 years 10 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
149
Voted
ISVC
2009
Springer
15 years 10 months ago
Group Action Recognition Using Space-Time Interest Points
Group action recognition is a challenging task in computer vision due to the large complexity induced by multiple motion patterns. This paper aims at analyzing group actions in vid...
Qingdi Wei, Xiaoqin Zhang, Yu Kong, Weiming Hu, Ha...