Sciweavers

3690 search results - page 227 / 738
» Computation with classical sequents
Sort
View
IUI
2012
ACM
14 years 3 hour ago
1F: one accessory feature design for gesture recognizers
One Feature (1F) is a simple and intuitive pruning strategy that reduces considerably the amount of computations required by Nearest-Neighbor gesture classifiers while still pres...
Radu-Daniel Vatavu
SOFSEM
2012
Springer
13 years 12 months ago
Randomized Group Testing Both Query-Optimal and Minimal Adaptive
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
Peter Damaschke, Azam Sheikh Muhammad
WACV
2012
IEEE
13 years 12 months ago
Kernel analysis over Riemannian manifolds for visual recognition of actions, pedestrians and textures
A convenient way of analysing Riemannian manifolds is to embed them in Euclidean spaces, with the embedding typically obtained by flattening the manifold via tangent spaces. This...
Mehrtash Tafazzoli Harandi, Conrad Sanderson, Arno...
INFOCOM
2012
IEEE
13 years 6 months ago
Experimental performance comparison of Byzantine Fault-Tolerant protocols for data centers
Abstract—In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solu...
Guanfeng Liang, Benjamin Sommer, Nitin H. Vaidya
154
Voted
CVPR
2012
IEEE
13 years 6 months ago
Boosting algorithms for simultaneous feature extraction and selection
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
Mohammad J. Saberian, Nuno Vasconcelos