2168 search results - page 30 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
Logic synthesis has made impressive progress in the last decade and has pervaded digital design replacing almost universally manual techniques. A remarkable exception is computer ...
MP
2007
13 years 7 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
ALMOB
2006
13 years 7 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
COLING
1996
13 years 9 months ago
1996
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
It is well-known that wavelet transforms provide sparse decompositions over many types of image regions but not over image singularities/edges that manifest themselves along curve...