6102 search results - page 611 / 1221 » Generating Optimizing Specializers |
224
click to vote
PEPM
1993
ACM
15 years 11 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
184
click to vote
ASPDAC
2007
ACM
15 years 11 months ago
2007
ACM
Abstract-- In this paper, a technique that can efficiently reduce peak and average switching activity during test application is proposed. The proposed method does not require any ...
168
Voted
ISSTA
2010
ACM
15 years 11 months ago
2010
ACM
The output of a disassembler is used for many different purposes (e.g., debugging and reverse engineering). Therefore, disassemblers represent the first link of a long chain of s...
206
click to vote
EUROCRYPT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
208
Voted
ICDM
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we present Concept Chain Queries (CCQ), a special case of text mining in document collections focusing on detecting links between two topics across text documents. ...