Sciweavers

3378 search results - page 654 / 676
» A universe of binding and computation
Sort
View
HICSS
2010
IEEE
200views Biometrics» more  HICSS 2010»
14 years 26 days ago
Instability of Relevance-Ranked Results Using Latent Semantic Indexing for Web Search
1 The latent semantic indexing (LSI) methodology for information retrieval applies the singular value decomposition to identify an eigensystem for a large matrix, in which cells re...
Houssain Kettani, Gregory B. Newby
CAV
2008
Springer
122views Hardware» more  CAV 2008»
14 years 26 days ago
Thread Quantification for Concurrent Shape Analysis
In this paper we address the problem of shape analysis for concurrent programs. We present new algorithms, based on abstract interpretation, for automatically verifying properties ...
Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Rama...
CCS
2008
ACM
14 years 26 days ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung
COMPGEOM
2005
ACM
14 years 25 days ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
COLT
2008
Springer
14 years 20 days ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim