9387 search results - page 391 / 1878 » An Optimal Process Model for a Real Time Process |
170
click to vote
PKC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
170
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract-- In this paper, a downlink scenario in which a singleantenna base station communicates with K single antenna users, over a time-correlated fading channel, is considered. ...
170
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
163
click to vote
SIGMETRICS
1998
ACM
15 years 11 months ago
1998
ACM
In many real applications, for example those with frequent and irregular communication patterns or those using large messages, network contention and contention for message proces...
187
click to vote
DKE
2006
15 years 6 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....