Sciweavers

1066 search results - page 49 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
MFCS
2005
Springer
15 years 3 months ago
Regular Sets of Higher-Order Pushdown Stacks
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
Arnaud Carayol
FC
1997
Springer
86views Cryptology» more  FC 1997»
15 years 1 months ago
The SPEED Cipher
Abstract. SPEED is a private key block cipher. It supports three variable parameters: (1) data length — the length of a plaintext/ciphertext of SPEED can be 64, 128 or 256 bits. ...
Yuliang Zheng
CVPR
2008
IEEE
15 years 4 months ago
3D face tracking and expression inference from a 2D sequence using manifold learning
We propose a person-dependent, manifold-based approach for modeling and tracking rigid and nonrigid 3D facial deformations from a monocular video sequence. The rigid and nonrigid ...
Wei-Kai Liao, Gérard G. Medioni
ISPASS
2007
IEEE
15 years 4 months ago
Accelerating Full-System Simulation through Characterizing and Predicting Operating System Performance
The ongoing trend of increasing computer hardware and software complexity has resulted in the increase in complexity and overheads of cycle-accurate processor system simulation, e...
Seongbeom Kim, Fang Liu, Yan Solihin, Ravi R. Iyer...
CORR
2007
Springer
110views Education» more  CORR 2007»
14 years 9 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright