Sciweavers

8695 search results - page 86 / 1739
» Making the Complex Simple
Sort
View
COMPUTER
1998
94views more  COMPUTER 1998»
13 years 7 months ago
Multiprocessors Should Support Simple Memory-Consistency Models
provide tools or abstractions that allow developers to program in parallel. But what hardware do we need to support shared memory threads? The hardware should provide a well-defin...
Mark D. Hill
PUC
2010
122views more  PUC 2010»
13 years 6 months ago
What is happening now? Detection of activities of daily living from simple visual features
We propose and investigate a paradigm for activity recognition, distinguishing the ‘on-going activity’ recognition task (OGA) from that addressing ‘complete activities’ (C...
Bruno Lepri, Nadia Mana, Alessandro Cappelletti, F...
FGR
2011
IEEE
255views Biometrics» more  FGR 2011»
12 years 12 months ago
Beyond simple features: A large-scale feature search approach to unconstrained face recognition
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
David D. Cox, Nicolas Pinto
SODA
2012
ACM
209views Algorithms» more  SODA 2012»
11 years 10 months ago
Simple and practical algorithm for sparse Fourier transform
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
ASIACRYPT
2009
Springer
14 years 2 months ago
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
Anja Lehmann, Stefano Tessaro