Sciweavers

1272 search results - page 196 / 255
» The Set Cover with Pairs Problem
Sort
View
INFOCOM
2011
IEEE
13 years 1 months ago
Optimal multiple-coverage of sensor networks
—In wireless sensor networks, multiple-coverage, in which each point is covered by more than one sensor, is often required to improve detection quality and achieve high fault tol...
Xiaole Bai, Ziqiu Yun, Dong Xuan, Biao Chen, Wei Z...
ALT
2000
Springer
14 years 2 months ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata
CVPR
2009
IEEE
1081views Computer Vision» more  CVPR 2009»
15 years 5 months ago
Learning Real-Time MRF Inference for Image Denoising
Many computer vision problems can be formulated in a Bayesian framework with Markov Random Field (MRF) or Conditional Random Field (CRF) priors. Usually, the model assumes that ...
Adrian Barbu (Florida State University)
CVPR
2003
IEEE
15 years 9 days ago
Clustering Appearances of Objects Under Varying Illumination Conditions
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
Jeffrey Ho, Ming-Hsuan Yang, Jongwoo Lim, Kuang-Ch...
CVPR
2008
IEEE
15 years 9 days ago
Performance evaluation of state-of-the-art discrete symmetry detection algorithms
Symmetry is one of the important cues for human and machine perception of the world. For over three decades, automatic symmetry detection from images/patterns has been a standing ...
Minwoo Park, Seungkyu Lee, Po-Chun Chen, Somesh Ka...