1458 search results - page 226 / 292 » Monads for incremental computing |
114
click to vote
DAC
2002
ACM
16 years 5 months ago
2002
ACM
We extend in this paper the concept of the P-admissible floorplan representation to that of the P*-admissible one. A P*-admissible representation can model the most general floorp...
134
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
111
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
Trajectory methods sample the state trajectory of a circuit as it simulates in the time domain, and build macromodels by reducing and interpolating among the linearizations create...
172
click to vote
ICML
2000
IEEE
16 years 5 months ago
2000
IEEE
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
144
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...