6110 search results - page 1025 / 1222 » Approximate Computing |
178
Voted
ACMMSP
2004
ACM
16 years 12 days ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
241
click to vote
SIGIR
2004
ACM
16 years 11 days ago
2004
ACM
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
167
Voted
APPROX
2004
Springer
16 years 11 days ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
186
Voted
ARCS
2004
Springer
16 years 11 days ago
2004
Springer
In a pervasive computing environment, one is facing the problem of handling heterogeneous data from different sources, transmitted over heterogeneous channels and presented on het...
163
click to vote
AUSAI
2004
Springer
16 years 11 days ago
2004
Springer
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....