1763 search results - page 270 / 353 » A Formalization of Polytime Functions |
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
ICDM
2007
IEEE
15 years 4 months ago
2007
IEEE
Frequent itemsets mining is a popular framework for pattern discovery. In this framework, given a database of customer transactions, the task is to unearth all patterns in the for...
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
– With our proposed decomposition into layers, a generic framework leading to the reuse of previously produced software and the extraction of useful portions can be achieved. The...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Temporal dependence within the workload of any computing or networking system has been widely recognized as a significant factor affecting performance. More specifically, burstin...
ISCAS
2007
IEEE
15 years 4 months ago
2007
IEEE
— In state of the art hardware-software-co-design flows for FPGA based systems, the hardware-software partitioning problem is solved offline, thus, omitting the great flexibil...