Sciweavers

10820 search results - page 2155 / 2164
» Understanding the
Sort
View
KDD
2012
ACM
221views Data Mining» more  KDD 2012»
11 years 10 months ago
Fast mining and forecasting of complex time-stamped events
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
Yasuko Matsubara, Yasushi Sakurai, Christos Falout...
SIGIR
2012
ACM
11 years 10 months ago
Task complexity, vertical display and user interaction in aggregated search
Aggregated search is the task of blending results from specialized search services or verticals into the Web search results. While many studies have focused on aggregated search t...
Jaime Arguello, Wan-Ching Wu, Diane Kelly, Ashlee ...
TON
2012
11 years 10 months ago
Exploiting Data Fusion to Improve the Coverage of Wireless Sensor Networks
Abstract—Wireless sensor networks (WSNs) have been increasingly available for critical applications such as security surveillance and environmental monitoring. An important perfo...
Rui Tan, Guoliang Xing, Benyuan Liu, Jianping Wang...
SODA
2012
ACM
226views Algorithms» more  SODA 2012»
11 years 10 months ago
On the hardness of pricing loss-leaders
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
Preyas Popat, Yi Wu
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
11 years 10 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
« Prev « First page 2155 / 2164 Last » Next »