Sciweavers

2084 search results - page 275 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
WWW
2009
ACM
15 years 10 months ago
Adaptive bidding for display advertising
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...
Arpita Ghosh, Benjamin I. P. Rubinstein, Sergei Va...
ISVD
2010
IEEE
14 years 8 months ago
Guaranteed Quality Tetrahedral Delaunay Meshing for Medical Images
—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...
Panagiotis A. Foteinos, Andrey N. Chernikov, Nikos...
GIS
2009
ACM
15 years 11 months ago
Efficient and Secure Distribution of Massive Geo-Spatial Data
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...
Hao Yuan, Mikhail J. Atallah
MOBISYS
2004
ACM
15 years 9 months ago
Exponential Index: A Parameterized Distributed Indexing Scheme for Data on Air
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...
Jianliang Xu, Wang-Chien Lee, Xueyan Tang
JMLR
2012
13 years 11 days ago
Contextual Bandit Learning with Predictable Rewards
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...
Alekh Agarwal, Miroslav Dudík, Satyen Kale,...