Sciweavers

740 search results - page 106 / 148
» Lower bounds for Buchsbaum* complexes
Sort
View
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
15 years 4 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig
PODC
2010
ACM
15 years 10 months ago
Constant RMR solutions to reader writer synchronization
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
Vibhor Bhatt, Prasad Jayanti
ICDE
2006
IEEE
110views Database» more  ICDE 2006»
16 years 7 months ago
Mining Dense Periodic Patterns in Time Series Data
Existing techniques to mine periodic patterns in time series data are focused on discovering full-cycle periodic patterns from an entire time series. However, many useful partial ...
Chang Sheng, Wynne Hsu, Mong-Li Lee
FSTTCS
2009
Springer
16 years 23 days 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...
ACAL
2007
Springer
16 years 11 days ago
Structural Circuits and Attractors in Kauffman Networks
There has been some ambiguity about the growth of attractors in Kauffman networks with network size. Some recent work has linked this to the role and growth of circuits or loops o...
Kenneth A. Hawick, Heath A. James, Chris Scogings