8582 search results - page 1387 / 1717 » Here or There |
187
click to vote
TAMC
2007
Springer
16 years 26 days ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
201
click to vote
TARK
2007
Springer
16 years 26 days ago
2007
Springer
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elect...
191
click to vote
WABI
2007
Springer
16 years 26 days ago
2007
Springer
The comprehensive annotation of non-coding RNAs in newly sequenced genomes is still a largely unsolved problem because many functional RNAs exhibit not only poorly conserved sequen...
215
click to vote
WADS
2007
Springer
16 years 26 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
191
click to vote
WADS
2007
Springer
16 years 26 days ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...