Sciweavers

5384 search results - page 984 / 1077
» Open Standards Requirements
Sort
View
107
Voted
PODS
2005
ACM
151views Database» more  PODS 2005»
15 years 11 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
96
Voted
PODS
2008
ACM
159views Database» more  PODS 2008»
15 years 11 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
EDBT
2008
ACM
169views Database» more  EDBT 2008»
15 years 11 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
ICSE
2004
IEEE-ACM
15 years 11 months ago
Concerning Predictability in Dependable Component-Based Systems: Classification of Quality Attributes
One of the main objectives of developing component-based software systems is to enable efficient building of systems through the integration of components. All component models def...
Ivica Crnkovic, Magnus Larsson, Otto Preiss
ICFP
2003
ACM
15 years 11 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano