Sciweavers

864 search results - page 133 / 173
» A general markov framework for page importance computation
Sort
View
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 9 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
14 years 9 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
AOSD
2010
ACM
14 years 4 months ago
Tracking code patterns over multiple software versions with Herodotos
An important element of understanding a software code base is to identify the repetitive patterns of code it contains and how these evolve over time. Some patterns are useful to t...
Nicolas Palix, Julia L. Lawall, Gilles Muller
CCS
2009
ACM
14 years 3 months ago
A practical property-based bootstrap architecture
Binary attestation, as proposed by the Trusted Computing Group (TCG), is a pragmatic approach for software integrity protection and verification. However, it has also various sho...
René Korthaus, Ahmad-Reza Sadeghi, Christia...
IMC
2009
ACM
14 years 3 months ago
Triangle inequality variations in the internet
Triangle inequality violations (TIVs) are important for latency sensitive distributed applications. On one hand, they can expose opportunities to improve network routing by findi...
Cristian Lumezanu, Randolph Baden, Neil Spring, Bo...