2996 search results - page 227 / 600 » Numberings and Randomness |
204
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
176
click to vote
NETGAMES
2006
ACM
16 years 17 days ago
2006
ACM
Broadcasting all state changes to every player of a massively multiplayer game is not a viable solution. To successfully overcome the challenge of scale, massively multiplayer gam...
173
click to vote
ISAAC
2005
Springer
16 years 3 days ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
180
click to vote
JCO
2008
15 years 6 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
166
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this work, we prove that a positive secure degree of freedom is achievable for a large class of real Gaussian channels as long as the channel is not degraded and the channel ...