Sciweavers

3333 search results - page 231 / 667
» Optimal Power-Down Strategies
Sort
View
195
Voted
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 11 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
ACMICEC
2007
ACM
154views ECommerce» more  ACMICEC 2007»
15 years 10 months ago
Learning and adaptivity in interactive recommender systems
Recommender systems are intelligent E-commerce applications that assist users in a decision-making process by offering personalized product recommendations during an interaction s...
Tariq Mahmood, Francesco Ricci
SIGECOM
2006
ACM
88views ECommerce» more  SIGECOM 2006»
16 years 17 days ago
Implementation with a bounded action space
While traditional mechanism design typically assumes isomorphism between the agents’ type- and action spaces, in many situations the agents face strict restrictions on their act...
Liad Blumrosen, Michal Feldman
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 6 months ago
On Optimum Power Allocation for the V-BLAST
—A unified analytical framework for optimum power allocation in the unordered V-BLAST algorithm and its comparative performance analysis are presented. Compact closed-form appro...
Victoria Kostina, Sergey Loyka
FGCS
2000
81views more  FGCS 2000»
15 years 6 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch