Sciweavers

35419 search results - page 188 / 7084
» How are we doing
Sort
View
SPDP
1993
IEEE
15 years 8 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
VLDB
2002
ACM
137views Database» more  VLDB 2002»
15 years 4 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...
JOCN
2010
74views more  JOCN 2010»
15 years 2 months ago
Connecting the Dots: How Local Structure Affects Global Integration in Infants
■ Glass patterns are moirés created from a sparse random-dot field paired with its spatially shifted copy. Because discrimination of these patterns is not based on local featur...
Melanie Palomares, Mark W. Pettet, Vladimir Vildav...
PROMISE
2010
14 years 11 months ago
How effective is Tabu search to configure support vector regression for effort estimation?
Background. Recent studies have shown that Support Vector Regression (SVR) has an interesting potential in the field of effort estimation. However applying SVR requires to careful...
Anna Corazza, Sergio Di Martino, Filomena Ferrucci...
IPPS
1996
IEEE
15 years 8 months ago
How to Optimize Residual Communications?
Minimizing communications when mapping affine loop nests onto distributed memory parallel computers has already drawn a lot of attention. This paper focuses on the next step: as i...
Michèle Dion, Cyril Randriamaro, Yves Rober...