Sciweavers

1272 search results - page 154 / 255
» The Set Cover with Pairs Problem
Sort
View
TKDE
2012
245views Formal Methods» more  TKDE 2012»
12 years 1 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
CVPR
2008
IEEE
15 years 19 days ago
Skeletal graphs for efficient structure from motion
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
Noah Snavely, Steven M. Seitz, Richard Szeliski
SMI
2010
IEEE
167views Image Analysis» more  SMI 2010»
13 years 9 months ago
RBF Dipole Surface Evolution
—The level set method can implement a wide variety of shape modeling operations (e.g. offsetting, skeletonization, morphing, blending, smoothing, sharpening, embossing, denoising...
Yuntao Jia, Xinlai Ni, Eric Lorimer, Michael Mulla...
CVPR
2004
IEEE
15 years 19 days ago
Super-Resolution through Neighbor Embedding
In this paper, we propose a novel method for solving single-image super-resolution problems. Given a low-resolution image as input, we recover its highresolution counterpart using...
Hong Chang, Dit-Yan Yeung, Yimin Xiong
EDBT
2008
ACM
154views Database» more  EDBT 2008»
14 years 10 months ago
Ring-constrained join: deriving fair middleman locations from pointsets via a geometric constraint
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
Man Lung Yiu, Panagiotis Karras, Nikos Mamoulis