10414 search results - page 478 / 2083 » An efficient algorithm for Co-segmentation |
191
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
199
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Software distributed shared memory (DSM) techniques, while effective on applications with coarse-grained sharing, yield poor performance for the fine-grained sharing encountered i...
147
Voted
OOPSLA
1997
Springer
15 years 10 months ago
1997
Springer
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyp...
159
click to vote
FASE
2010
Springer
15 years 10 months ago
2010
Springer
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
172
click to vote
AAAI
2008
15 years 9 months ago
2008
Conditional random field (CRF) is a popular graphical model for sequence labeling. The flexibility of CRF poses significant computational challenges for training. Using existing o...