Sciweavers

2079 search results - page 8 / 416
» Universality of random graphs
Sort
View
PATAT
2000
Springer
124views Education» more  PATAT 2000»
15 years 3 months ago
Tabu Search Techniques for Examination Timetabling
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...
Luca Di Gaspero, Andrea Schaerf
FOCS
2002
IEEE
15 years 4 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
WINE
2007
Springer
124views Economy» more  WINE 2007»
15 years 5 months ago
On the Price of Truthfulness in Path Auctions
We study the frugality ratio of truthful mechanisms in path auctions, which measures the extent to which truthful mechanisms “overpay” compared to non-truthful mechanisms. In p...
Qiqi Yan
66
Voted
TIT
1998
50views more  TIT 1998»
14 years 11 months ago
Memory-Universal Prediction of Stationary Random Processes
Abstract— We consider the problem of one-step-ahead prediction of a real-valued, stationary, strongly mixing random process fXig
Dharmendra S. Modha, Elias Masry
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
14 years 11 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye