5606 search results - page 394 / 1122 » Randomization Techniques for Graphs. |
144
click to vote
ICISC
2003
15 years 8 months ago
2003
Abstract. It had been thought that it is difficult to provide receiptfreeness in mixnet-based electronic voting schemes. Any kind of user chosen randomness can be used to construct...
172
click to vote
APSEC
2004
IEEE
15 years 10 months ago
2004
IEEE
In embedded software development, the programming language C and inline assembly code are traditionally widely used. However, tools for C program-understanding, e.g., cross-refere...
173
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
Collections are a fundamental tool for reproducible evaluation of information retrieval techniques. We describe a new method for distributing the document lengths and term counts ...
199
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
137
click to vote
ACL
2000
15 years 8 months ago
2000
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...