Sciweavers

2424 search results - page 146 / 485
» A general algorithm for data dependence analysis
Sort
View
147
Voted
APPT
2007
Springer
15 years 5 months ago
A Parallel BSP Algorithm for Irregular Dynamic Programming
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
Malcolm Yoke-Hean Low, Weiguo Liu, Bertil Schmidt
125
Voted
SIGMOD
2010
ACM
191views Database» more  SIGMOD 2010»
15 years 3 months ago
Data conflict resolution using trust mappings
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...
Wolfgang Gatterbauer, Dan Suciu
138
Voted
JUCS
2006
92views more  JUCS 2006»
15 years 3 months ago
Program Slicing by Calculation
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
Nuno F. Rodrigues, Luís Soares Barbosa
SIGSOFT
2003
ACM
16 years 4 months ago
Context-sensitive slicing of concurrent programs
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
Jens Krinke
FOCS
2000
IEEE
15 years 7 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk