Sciweavers

9842 search results - page 1344 / 1969
» Problem complexity
Sort
View
CVPR
2010
IEEE
15 years 7 months ago
Illumination compensation based change detection using order consistency
We present a change detection method resistant to global and local illumination variations for use in visual surveillance scenarios. Approaches designed thus far for robustness to...
Vasu Parameswaran, Maneesh Singh, Visvanathan Rame...
JCC
2006
110views more  JCC 2006»
15 years 7 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs
ICCV
2007
IEEE
16 years 9 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 8 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 8 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 1344 / 1969 Last » Next »