Sciweavers

640 search results - page 69 / 128
» Reasoning About Web-Site Structure
Sort
View
ICDT
2005
ACM
88views Database» more  ICDT 2005»
14 years 1 months ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
PEPM
2011
ACM
12 years 10 months ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura
EGOV
2004
Springer
14 years 1 months ago
PARMENIDES: Facilitating Democratic Debate
Abstract. This paper describes PARMENIDES, a system which facilitates structured debate about government policy. 1 The PARMENIDES System The last two decades have seen a deliberati...
Katie Atkinson, Trevor J. M. Bench-Capon, Peter Mc...
POPL
2009
ACM
14 years 8 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
PPOPP
2012
ACM
12 years 3 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...