Sciweavers

1985 search results - page 227 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
130
Voted
PLDI
2006
ACM
15 years 9 months ago
The Compressor: concurrent, incremental, and parallel compaction
The widely used Mark-and-Sweep garbage collector has a drawback in that it does not move objects during collection. As a result, large long-running realistic applications, such as...
Haim Kermany, Erez Petrank
TCAD
1998
114views more  TCAD 1998»
15 years 3 months ago
Behavioral optimization using the manipulation of timing constraints
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
Miodrag Potkonjak, Mani B. Srivastava
144
Voted
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 9 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
127
Voted
ADBIS
2007
Springer
124views Database» more  ADBIS 2007»
15 years 9 months ago
Fast and Efficient Log File Compression
Contemporary information systems are replete with log files, created in multiple places (e.g., network servers, database management systems, user monitoring applications, system se...
Przemyslaw Skibinski, Jakub Swacha
142
Voted
KDD
2006
ACM
191views Data Mining» more  KDD 2006»
16 years 4 months ago
Beyond classification and ranking: constrained optimization of the ROI
Classification has been commonly used in many data mining projects in the financial service industry. For instance, to predict collectability of accounts receivable, a binary clas...
Lian Yan, Patrick Baldasare