Sciweavers

60 search results - page 3 / 12
» Random Order m-ary Exponentiation
Sort
View
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
14 years 23 days ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram
ICML
2004
IEEE
14 years 9 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 8 months ago
State Elimination Ordering Strategies: Some Experimental Results
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
Nelma Moreira, Davide Nabais, Rogério Reis
AAAI
2008
13 years 11 months ago
CRF-OPT: An Efficient High-Quality Conditional Random Field Solver
Conditional random field (CRF) is a popular graphical model for sequence labeling. The flexibility of CRF poses significant computational challenges for training. Using existing o...
Minmin Chen, Yixin Chen, Michael R. Brent
ATAL
2009
Springer
14 years 3 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...