14084 search results - page 2528 / 2817 » A Theory for Game Theories |
157
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
215
click to vote
WWW
2009
ACM
16 years 1 months ago
2009
ACM
Traditional relation extraction methods require pre-specified relations and relation-specific human-tagged examples. Bootstrapping systems significantly reduce the number of tr...
174
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
Super-resolution is the art of creating nice high-resolution raster images from given low-resolution raster images. Since “nice” is not a well-defined term in mathematics and ...
181
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....
172
click to vote
ICS
2009
Tsinghua U.
16 years 1 months ago
2009
Tsinghua U.
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...