Sciweavers

1647 search results - page 138 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
144
Voted
DAWAK
2008
Springer
15 years 6 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash
JSAC
2011
126views more  JSAC 2011»
14 years 12 months ago
Spectrum Management in Multiuser Cognitive Wireless Networks: Optimality and Algorithm
Abstract— Spectrum management is used to improve performance in multiuser communication system, e.g., cognitive radio or femtocell networks, where multiuser interference can lead...
Chee Wei Tan, S. Friedland, Steven H. Low
TC
2008
15 years 4 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
ICCV
2009
IEEE
16 years 10 months ago
Semi-Supervised Random Forests
Random Forests (RFs) have become commonplace in many computer vision applications. Their popularity is mainly driven by their high computational efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...
WWW
2008
ACM
16 years 5 months ago
Budget constrained bidding in keyword auctions and online knapsack problems
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Luko...