Sciweavers

465 search results - page 15 / 93
» On the Hardness of Range Assignment Problems
Sort
View
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 4 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
66
Voted
STACS
2005
Springer
15 years 5 months ago
Roundings Respecting Hard Constraints
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
Benjamin Doerr
CODES
2008
IEEE
15 years 1 months ago
Guaranteed scheduling for repetitive hard real-time tasks under the maximal temperature constraint
We study the problem of scheduling repetitive real-time tasks with the Earliest Deadline First (EDF) policy that can guarantee the given maximal temperature constraint. We show th...
Gang Quan, Yan Zhang, William Wiles, Pei Pei
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
16 years 9 days ago
Entity discovery and assignment for opinion mining applications
Opinion mining became an important topic of study in recent years due to its wide range of applications. There are also many companies offering opinion mining services. One proble...
Xiaowen Ding, Bing Liu, Lei Zhang
LCN
2008
IEEE
15 years 6 months ago
Range queries and load balancing in a hierarchically structured P2P system
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
Simon Rieche, Bui The Vinh, Klaus Wehrle