Sciweavers

4313 search results - page 162 / 863
» Using time travel to diagnose computer problems
Sort
View
DATE
2006
IEEE
102views Hardware» more  DATE 2006»
16 years 1 months ago
Faster exploration of high level design alternatives using UML for better partitions
Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
Waseem Ahmed, Doug Myers
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 7 months ago
Finding low-weight polynomial multiples using discrete logarithm
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
Frédéric Didier, Yann Laigle-Chapuy
RE
2004
Springer
16 years 12 days ago
Architecture-driven Problem Decomposition
Jackson’s Problem Frames provide a means of analysing and decomposing problems. They emphasise the world outside the computer helping the developer to focus on the problem domai...
Lucia Rapanotti, Jon G. Hall, Michael Jackson, Bas...
JMLR
2006
124views more  JMLR 2006»
15 years 7 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
ANOR
2010
153views more  ANOR 2010»
15 years 4 months ago
Solving the Rectangular assignment problem and applications
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
J. Bijsterbosch, A. Volgenant