Sciweavers

8294 search results - page 1524 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
COR
2006
97views more  COR 2006»
15 years 3 months ago
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
Davy Janssens, Tom Brijs, Koen Vanhoof, Geert Wets
127
Voted
WWW
2009
ACM
16 years 4 months ago
An axiomatic approach for result diversification
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
Sreenivas Gollapudi, Aneesh Sharma
WWW
2007
ACM
16 years 4 months ago
Learning information intent via observation
Workers in organizations frequently request help from assistants by sending request messages that express information intent: an intention to update data in an information system....
Anthony Tomasic, Isaac Simmons, John Zimmerman
SIGMOD
2002
ACM
93views Database» more  SIGMOD 2002»
16 years 3 months ago
Implementing database operations using SIMD instructions
Modern CPUs have instructions that allow basic operations to be performed on several data elements in parallel. These instructions are called SIMD instructions, since they apply a...
Jingren Zhou, Kenneth A. Ross
ICS
2009
Tsinghua U.
15 years 10 months ago
MPI-aware compiler optimizations for improving communication-computation overlap
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...
Anthony Danalis, Lori L. Pollock, D. Martin Swany,...
« Prev « First page 1524 / 1659 Last » Next »