62 search results - page 4 / 13 » A New Approach and Faster Exact Methods for the Maximum Comm... |
ICCV
2003
IEEE
14 years 10 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
IJCV
2011
13 years 3 months ago
2011
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
— Contact dynamics are commonly formulated as a linear complementarity problem. While this approach is superior to earlier spring-damper models, it can be inaccurate due to pyram...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
Applications such as traffic management and resource scheduling for location-based services commonly need to identify regions with high concentrations of moving objects. Such quer...
JCB
2006
13 years 8 months ago
2006
A commonly used tool in disease association studies is the search for discrepancies between the haplotype distribution in the case and control populations. In order to find this d...