406 search results - page 9 / 82 » Fast Increment Registers |
VLDB
1994
ACM
14 years 1 months ago
1994
ACM
Full-text information retrieval systems have traditionally been designed for archival environments. They often provide little or no support for adding new documents to an existing...
ASPDAC
2010
ACM
13 years 7 months ago
2010
ACM
To cope with an increasing complexity when analyzing analog mismatch in sub-90nm designs, this paper presents a fast non-MonteCarlo method to calculate mismatch in time domain. Th...
ASPDAC
2005
ACM
13 years 11 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
HIPC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
KDD
2010
ACM
14 years 1 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...