Sciweavers

7200 search results - page 348 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
SIGMOD
2008
ACM
182views Database» more  SIGMOD 2008»
16 years 7 months ago
Angle-based space partitioning for efficient parallel skyline computation
Recently, skyline queries have attracted much attention in the database research community. Space partitioning techniques, such as recursive division of the data space, have been ...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 6 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
POPL
2010
ACM
16 years 1 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
CODES
2005
IEEE
16 years 12 days ago
Blue matter on blue gene/L: massively parallel computation for biomolecular simulation
This paper provides an overview of the Blue Matter application development effort within the Blue Gene project that supports our scientific simulation efforts in the areas of pro...
Robert S. Germain, Blake G. Fitch, Aleksandr Raysh...
CIKM
2004
Springer
15 years 10 months ago
Taxonomy-driven computation of product recommendations
Recommender systems have been subject to an enormous rise in popularity and research interest over the last ten years. At the same time, very large taxonomies for product classifi...
Cai-Nicolas Ziegler, Georg Lausen, Lars Schmidt-Th...