7773 search results - page 139 / 1555 » On generalized Frame-Stewart numbers |
WEA
2007
Springer
15 years 4 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
107
click to vote
DEXA
2004
Springer
15 years 3 months ago
2004
Springer
: In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently and effectively. In XAR-Miner, raw XML data are first transformed to either...
104
click to vote
COMBINATORICA
2010
14 years 5 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
TCC
2009
Springer
15 years 10 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
ICCAD
2006
IEEE
15 years 4 months ago
2006
IEEE
Traditionally, at early design stages, leakage power is associated with the number of transistors in a design. Hence, intuitively an implementation with minimum resource usage wou...