10414 search results - page 146 / 2083 » An efficient algorithm for Co-segmentation |
162
click to vote
CODES
2004
IEEE
15 years 10 months ago
2004
IEEE
Hardware/software (HW-SW) partitioning is a key problem in the codesign of embedded systems, studied extensively in the past. One major open challenge for traditional partitioning...
167
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysi...
147
click to vote
ESA
2010
Springer
15 years 6 months ago
2010
Springer
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
149
click to vote
IPL
2000
15 years 6 months ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
271
click to vote
ICDE
2001
IEEE
16 years 7 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...