Sciweavers

1604 search results - page 269 / 321
» Approximation algorithms for developable surfaces
Sort
View
TCBB
2011
13 years 3 months ago
Accurate Construction of Consensus Genetic Maps via Integer Linear Programming
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
Yonghui Wu, Timothy J. Close, Stefano Lonardi
CVPR
2011
IEEE
13 years 17 days ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
ICASSP
2011
IEEE
13 years 17 days ago
Stochastic resource allocation for cognitive radio networks based on imperfect state information
Efficient design of cognitive radio networks calls for secondary users implementing adaptive resource allocation, which requires knowledge of the channel state information in ord...
Antonio G. Marqués, Georgios B. Giannakis, ...
ICASSP
2011
IEEE
13 years 17 days ago
SSIM-inspired image denoising using sparse representations
Perceptual image quality assessment (IQA) and sparse signal representation have recently emerged as high-impact research topics in the field of image processing. Here we make one...
Abdul Rehman, Zhou Wang, Dominique Brunet, Edward ...
CVPR
2012
IEEE
11 years 11 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun