Sciweavers

319 search results - page 38 / 64
» Cryptographic Assumptions: A Position Paper
Sort
View
CCS
2007
ACM
15 years 3 months ago
Provably secure ciphertext policy ABE
In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on a...
Ling Cheung, Calvin C. Newport
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
15 years 2 months ago
Studying the Advantages of a Messy Evolutionary Algorithm for Natural Language Tagging
The process of labeling each word in a sentence with one of its lexical categories (noun, verb, etc) is called tagging and is a key step in parsing and many other language processi...
Lourdes Araujo
104
Voted
JACM
2011
152views more  JACM 2011»
14 years 17 days ago
Robust principal component analysis?
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
Emmanuel J. Candès, Xiaodong Li, Yi Ma, Joh...
ICCV
1998
IEEE
15 years 11 months ago
Wormholes in Shape Space: Tracking Through Discontinuous Changes in Shape
Existing object tracking algorithms generally use some form of local optimisation, assuming that an object's position and shape change smoothly over time. In some situations ...
Tony Heap, David Hogg
PODS
2006
ACM
217views Database» more  PODS 2006»
15 years 9 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting