216 search results - page 31 / 44 » Edge Search Number of Cographs in Linear Time |
104
click to vote
IACR
2011
14 years 27 days ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
141
click to vote
EOR
2007
15 years 1 months ago
2007
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
115
click to vote
RSA
2002
15 years 28 days ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
ISCAS
2005
IEEE
15 years 6 months ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
ACCV
2010
Springer
14 years 8 months ago
2010
Springer
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...