17366 search results - page 3349 / 3474 » New Revision Algorithms |
161
click to vote
BIRTHDAY
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
138
click to vote
CIKM
2004
Springer
15 years 10 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
195
Voted
CPM
2004
Springer
15 years 10 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
159
click to vote
EUROCRYPT
2004
Springer
15 years 10 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
159
Voted
FPGA
2004
ACM
15 years 10 months ago
2004
ACM
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...