Sciweavers

17760 search results - page 45 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
ORL
2010
156views more  ORL 2010»
13 years 3 months ago
Advertisement allocation for generalized second-pricing schemes
Recently, there has been a surge of interest in algorithms that allocate advertisement space in an online revenue-competitive manner. Most such algorithms, however, assume a pay-a...
Ashish Goel, Mohammad Mahdian, Hamid Nazerzadeh, A...
COLT
1997
Springer
14 years 1 months ago
General Convergence Results for Linear Discriminant Updates
The problem of learning linear discriminant concepts can be solved by various mistake-driven update procedures, including the Winnow family of algorithms and the well-known Percep...
Adam J. Grove, Nick Littlestone, Dale Schuurmans
RTSS
2007
IEEE
14 years 3 months ago
Generalized Tardiness Bounds for Global Multiprocessor Scheduling
We consider the issue of deadline tardiness under global multiprocessor scheduling algorithms. We present a general tardiness-bound derivation that is applicable to a wide variety...
Hennadiy Leontyev, James H. Anderson
LCPC
2005
Springer
14 years 2 months ago
Applying Data Copy to Improve Memory Performance of General Array Computations
Abstract. Data copy is an important compiler optimization which dynamically rearranges the layout of arrays by copying their elements into local buffers. Traditionally, array copy...
Qing Yi
ICISC
2004
120views Cryptology» more  ICISC 2004»
13 years 10 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua