258 search results - page 48 / 52 » New Lower Bounds for Heilbronn Numbers |
CRYPTO
2011
Springer
12 years 7 months ago
2011
Springer
RFID security is currently one of the major challenges cryptography has to face, often solved by protocols assuming that an on-tag hash function is available. In this article we pr...
CCCG
1998
13 years 8 months ago
1998
Fast and efficient exploration of large terrains in a virtual reality manner requires different levels of detail to speedup processing of terrain parts in background. Thus, the tr...
ALENEX
2009
13 years 8 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
COR
2010
13 years 7 months ago
2010
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
SIAMMAX
2010
13 years 2 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...