Sciweavers

257 search results - page 11 / 52
» On the Complexity of Computing Units in a Number Field
Sort
View
IJCV
2008
241views more  IJCV 2008»
13 years 8 months ago
Object Class Recognition and Localization Using Sparse Features with Limited Receptive Fields
We investigate the role of sparsity and localized features in a biologically-inspired model of visual object classification. As in the model of Serre, Wolf, and Poggio, we first a...
Jim Mutch, David G. Lowe
SGP
2007
13 years 11 months ago
Elastic secondary deformations by vector field integration
We present an approach for elastic secondary deformations of shapes described as triangular meshes. The deformations are steered by the simulation of a low number of simple mass-s...
Wolfram von Funck, Holger Theisel, Hans-Peter Seid...
DCC
2002
IEEE
14 years 8 months ago
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
This contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields GF(qm ). Unlike the original algorithm, the method introd...
Jorge Guajardo, Christof Paar
IROS
2007
IEEE
158views Robotics» more  IROS 2007»
14 years 2 months ago
Feature selection in conditional random fields for activity recognition
Abstract— Temporal classification, such as activity recognition, is a key component for creating intelligent robot systems. In the case of robots, classification algorithms mus...
Douglas L. Vail, John D. Lafferty, Manuela M. Velo...
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 9 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai