Sciweavers

2767 search results - page 13 / 554
» Universal Exponentiation Algorithm
Sort
View
ACISP
2009
Springer
14 years 2 months ago
Random Order m-ary Exponentiation
This paper describes a m-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than...
Michael Tunstall
COLT
2006
Springer
14 years 1 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
CVPR
2009
IEEE
15 years 5 months ago
Efficient Kernels for Identifying Unbounded-Order Spatial Features
Higher order spatial features, such as doublets or triplets have been used to incorporate spatial information into the bag-of-local-features model. Due to computational limits, ...
Yimeng Zhang (Carnegie Mellon University), Tsuhan ...
FOCS
1992
IEEE
14 years 2 months ago
Efficient Inference of Partial Types
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...
STOC
1992
ACM
89views Algorithms» more  STOC 1992»
14 years 2 months ago
Exponential Lower Bounds for the Pigeonhole Principle
Paul Beame, Russell Impagliazzo, Jan Krajíc...