29908 search results - page 91 / 5982 » On the Complexity of |
STOC
2002
ACM
14 years 10 months ago
2002
ACM
TCC
2010
Springer
14 years 7 months ago
2010
Springer
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
FLOPS
2010
Springer
14 years 5 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
LATIN
2010
Springer
14 years 5 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
14 years 4 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...