1369 search results - page 205 / 274 » Lattice computations for random numbers |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
IJNSEC
2006
13 years 9 months ago
2006
This paper presents an efficient password-based authenticated encrypted group key agreement protocol immune to dictionary attack under the computation Diffie-Hellman (CDH) assumpt...
EOR
2007
13 years 9 months ago
2007
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model ro...
COLT
2010
Springer
13 years 7 months ago
2010
Springer
One of the most widely used techniques for data clustering is agglomerative clustering. Such algorithms have been long used across many different fields ranging from computational...