951 search results - page 166 / 191 » On the Computation of Correctly-Rounded Sums |
140
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
132
Voted
WWW
2002
ACM
16 years 4 months ago
2002
ACM
Aliasing occurs in Web transactions when requests containing different URLs elicit replies containing identical data payloads. Conventional caches associate stored data with URLs ...
141
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
138
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
156
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...