Sciweavers

7796 search results - page 297 / 1560
» On Generalized Schur Numbers
Sort
View
ASIACRYPT
2003
Springer
15 years 10 months ago
Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves
One of the recent thrust areas in research on hyperelliptic curve cryptography has been to obtain explicit formulae for performing arithmetic in the Jacobian of such curves. We con...
Pradeep Kumar Mishra, Palash Sarkar
CCS
2008
ACM
15 years 8 months ago
Private combinatorial group testing
Combinatorial group testing, given a set C of individuals ("customers"), consists of applying group tests on subsets of C for the purpose of identifying which members of...
Mikhail J. Atallah, Keith B. Frikken, Marina Blant...
CICLING
2006
Springer
15 years 8 months ago
Enriching Wordnets with New Relations and with Event and Argument Structures
Abstract. This paper argues that wordnets, being concept-based computational lexica, should include information on event and argument structures. This general approach is relevant ...
Raquel Amaro, Rui Pedro Chaves, Palmira Marrafa, S...
COMPGEOM
2005
ACM
15 years 8 months ago
Multi-pass geometric algorithms
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
Timothy M. Chan, Eric Y. Chen
COLT
2008
Springer
15 years 8 months ago
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
Jacob Abernethy, Elad Hazan, Alexander Rakhlin