Sciweavers

1806 search results - page 333 / 362
» Randomness and halting probabilities
Sort
View
ICDT
2010
ACM
211views Database» more  ICDT 2010»
14 years 7 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
ALT
2003
Springer
14 years 6 months ago
Learning a Subclass of Regular Patterns in Polynomial Time
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
John Case, Sanjay Jain, Rüdiger Reischuk, Fra...
WISEC
2009
ACM
14 years 4 months ago
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
Recent studies show that network coding can provide significant benefits to network protocols, such as increased throughput, reduced network congestion, higher reliability, and ...
Jing Dong, Reza Curtmola, Cristina Nita-Rotaru
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 4 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
INFOCOM
2009
IEEE
14 years 4 months ago
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks
— This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes ...
Eitan Altaian, Philippe Nain, Jean-Claude Bermond