Sciweavers

774 search results - page 64 / 155
» Process Discovery Using Integer Linear Programming
Sort
View
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 7 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
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
14 years 5 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
Martin Albrecht, Carlos Cid
102
Voted
WCRE
2002
IEEE
15 years 7 months ago
Exposing Data-Level Parallelism in Sequential Image Processing Algorithms
As new computer architectures are developed to exploit large-scale data-level parallelism, techniques are needed to retarget legacy sequential code to these platforms. Sequential ...
Lewis B. Baumstark Jr., Linda M. Wills
BMCBI
2008
78views more  BMCBI 2008»
15 years 2 months ago
A new protein linear motif benchmark for multiple sequence alignment software
Background: Linear motifs (LMs) are abundant short regulatory sites used for modulating the functions of many eukaryotic proteins. They play important roles in post-translational ...
Emmanuel Perrodou, Claudia Chica, Olivier Poch, To...
126
Voted
ENDM
2010
101views more  ENDM 2010»
15 years 2 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl