1254 search results - page 53 / 251 » Making Hard Problems Harder |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
DAC
2009
ACM
14 years 12 days ago
2009
ACM
Process scaling has given designers billions of transistors to work with. As feature sizes near the atomic scale, extensive variation and wearout inevitably make margining unecono...
EUROSYS
2011
ACM
12 years 11 months ago
2011
ACM
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Dimensionality reduction is an important issue when facing high-dimensional data. For supervised dimensionality reduction, Linear Discriminant Analysis (LDA) is one of the most po...
CODES
2007
IEEE
14 years 2 months ago
2007
IEEE
In current Field-Programmable-Logic Architecture (FPGA) design flows, it is very hard to control the routing of submodules. It is thus very hard to make an identical copy of an ex...