Sciweavers

6740 search results - page 1171 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
TON
2008
119views more  TON 2008»
15 years 4 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
13 years 6 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
CVPR
2001
IEEE
16 years 6 months ago
Simultaneous linear estimation of multiple view geometry and lens distortion
A bugbear of uncalibrated stereo reconstruction is that cameras which deviate from the pinhole model have to be pre-calibrated in order to correct for nonlinear lens distortion. I...
Andrew W. Fitzgibbon
CVPR
2003
IEEE
16 years 6 months ago
Object Removal by Exemplar-Based Inpainting
A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this...
Antonio Criminisi, Kentaro Toyama, Patrick P&eacut...
CVPR
2003
IEEE
16 years 6 months ago
Learning Affinity Functions for Image Segmentation: Combining Patch-based and Gradient-based Approaches
This paper studies the problem of combining region and boundary cues for natural image segmentation. We employ a large database of manually segmented images in order to learn an o...
Charless Fowlkes, David R. Martin, Jitendra Malik
« Prev « First page 1171 / 1348 Last » Next »