Sciweavers

2270 search results - page 432 / 454
» On the distribution of eigenvalues of graphs
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
MOBIHOC
2006
ACM
14 years 8 months ago
Performance analysis of mobility-assisted routing
Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established. Mobility was considered a necessary evil that inval...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
PEPM
2010
ACM
14 years 5 months ago
Context-sensitive analysis of obfuscated x86 executables
A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipul...
Arun Lakhotia, Davidson R. Boccardo, Anshuman Sing...
WWW
2010
ACM
14 years 3 months ago
Optimal rare query suggestion with implicit user feedback
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
Yang Song, Li-wei He
AOSD
2010
ACM
14 years 3 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