Sciweavers

9842 search results - page 1659 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICEIS
1999
IEEE
15 years 9 months ago
Contour Estimation on Piecewise Homogeneous Random Fields
: Contour Estimation, Bayesian Estimation, Random Fields, Dynamic Programming, Multigrid Methods. This paper addresses contour estimation on images modeled as piecewise homogeneous...
José A. Moinhos Cordeiro, José M. B....
CVPR
2006
IEEE
16 years 6 months ago
Object Pose Detection in Range Scan Data
We address the problem of detecting complex articulated objects and their pose in 3D range scan data. This task is very difficult when the orientation of the object is unknown, an...
Jim Rodgers, Dragomir Anguelov, Hoi-Cheung Pang, D...
ICCV
2007
IEEE
16 years 6 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
ICDE
2003
IEEE
102views Database» more  ICDE 2003»
16 years 6 months ago
Schema Mediation in Peer Data Management Systems
Intuitively, data management and data integration tools should be well-suited for exchanging information in a semantically meaningful way. Unfortunately, they suffer from two sign...
Alon Y. Halevy, Zachary G. Ives, Dan Suciu, Igor T...
WWW
2008
ACM
16 years 5 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen
« Prev « First page 1659 / 1969 Last » Next »