1591 search results - page 222 / 319 » Random lifts of graphs |
157
click to vote
PATAT
2000
Springer
15 years 8 months ago
2000
Springer
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...
175
click to vote
ACST
2006
15 years 5 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
145
click to vote
NIPS
2001
15 years 5 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
111
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channel...
123
click to vote
MSS
2008
IEEE
15 years 4 months ago
2008
IEEE
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a t...