Sciweavers

2124 search results - page 133 / 425
» Aggregating time partitions
Sort
View
DCC
2002
IEEE
16 years 6 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
BNCOD
2006
69views Database» more  BNCOD 2006»
15 years 8 months ago
Reducing Sub-transaction Aborts and Blocking Time Within Atomic Commit Protocols
Composed Web service transactions executed in distributed networks often require an atomic execution. Guaranteeing atomicity in mobile networks involves a lot more challenges than ...
Stefan Böttcher, Le Gruenwald, Sebastian Ober...
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
16 years 1 months ago
Improving Collaborative Filtering Recommendations Using External Data
This paper describes an approach for incorporating externally specified aggregate ratings information into certain types of collaborative filtering (CF) methods. For a statistic...
Akhmed Umyarov, Alexander Tuzhilin
RTAS
2006
IEEE
16 years 27 days ago
Granularity Aware (m, k) Queue Management for Real-time Media Servers
Real-time media servers are becoming increasingly important as the Internet supports more and more multimedia applications. In order to meet these ever increasing demands, real-ti...
Yingxin Jiang, Aaron Striegel
EOR
2007
90views more  EOR 2007»
15 years 6 months ago
Accelerating column generation for variable sized bin-packing problems
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
Cláudio Alves, José M. Valéri...