Sciweavers

1425 search results - page 183 / 285
» Beyond Dependency Graphs
Sort
View
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
14 years 8 months ago
On proximity oblivious testing
We initiate a systematic study of a special type of property testers. These testers consist of repeating a basic test for a number of times that depends on the proximity parameter...
Oded Goldreich, Dana Ron
PODC
2009
ACM
14 years 8 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
SIGMOD
2009
ACM
139views Database» more  SIGMOD 2009»
14 years 8 months ago
Vispedia: on-demand data integration for interactive visualization and exploration
Wikipedia is an example of the large, collaborative, semi-structured data sets emerging on the Web. Typically, before these data sets can be used, they must transformed into struc...
Bryan Chan, Justin Talbot, Leslie Wu, Nathan Sakun...
SIGMOD
2008
ACM
167views Database» more  SIGMOD 2008»
14 years 8 months ago
Efficient lineage tracking for scientific workflows
Data lineage and data provenance are key to the management of scientific data. Not knowing the exact provenance and processing pipeline used to produce a derived data set often re...
Thomas Heinis, Gustavo Alonso
MOBIHOC
2001
ACM
14 years 7 months ago
Comparison between graph-based and interference-based STDMA scheduling
Spatial reuse TDMA is a fixed assignment access scheme for multi-hop radio networks. The idea is to increase network capacity by letting several radio terminals use the same time ...
Anders Hansson, Jimmi Grönkvist