Sciweavers

6800 search results - page 1259 / 1360
» Testing with Functions as Specifications
Sort
View
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
14 years 6 days ago
Aggregation of Imprecise and Uncertain Information for Knowledge Discovery in Databases
We consider the problem of aggregation for uncertain and imprecise data. For such data, we define aggregation operators and use them to provide information on properties and patte...
Sally I. McClean, Bryan W. Scotney, Mary Shapcott
RANDOM
1998
Springer
14 years 6 days ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
VLDB
1998
ACM
82views Database» more  VLDB 1998»
14 years 6 days ago
Resource Scheduling for Composite Multimedia Objects
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
Minos N. Garofalakis, Yannis E. Ioannidis, Banu &O...
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 3 days ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
POPL
1994
ACM
14 years 2 days ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen
« Prev « First page 1259 / 1360 Last » Next »