2084 search results - page 275 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
136
click to vote
WWW
2009
ACM
16 years 3 months ago
2009
ACM
Motivated by the emergence of auction-based marketplaces for display ads such as the Right Media Exchange, we study the design of a bidding agent that implements a display adverti...
115
Voted
ISVD
2010
IEEE
15 years 28 days ago
2010
IEEE
—In this paper, we present a Delaunay refinement algorithm for meshing 3D medical images. We prove that (a) all the tetrahedra of the output mesh have radius-edge ratio less tha...
211
Voted
GIS
2009
ACM
16 years 3 months ago
2009
ACM
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
136
Voted
MOBISYS
2004
ACM
16 years 2 months ago
2004
ACM
Wireless data broadcast has received a lot of attention from industries and academia in recent years. Access efficiency and energy conservation are two critical performance concer...
162
Voted
JMLR
2012
13 years 4 months ago
2012
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...