A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
This paper presents a finding and a technique on program behavior prediction. The finding is that surprisingly strong statistical correlations exist among the behaviors of diffe...
Yunlian Jiang, Eddy Z. Zhang, Kai Tian, Feng Mao, ...
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
—Peer-assisted Video-on-Demand (VoD) systems have not only received substantial recent research attention, but also been implemented and deployed with success in large-scale real...
ABSTRACT: We examine an environment where goods and privately informed buyers arrive stochastically to a market. A seller in this setting faces a sequential allocation problem with...