Sciweavers

150 search results - page 13 / 30
» A Linear Algorithm for Computing the Homography from Conics ...
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
CVPR
2007
IEEE
14 years 10 months ago
Resolving Objects at Higher Resolution from a Single Motion-blurred Image
Motion blur can degrade the quality of images and is considered a nuisance for computer vision problems. In this paper, we show that motion blur can in-fact be used for increasing...
Amit K. Agrawal, Ramesh Raskar
SEMWEB
2009
Springer
14 years 3 months ago
Computing Minimal Mappings
Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such ...
Fausto Giunchiglia, Vincenzo Maltese, Aliaksandr A...
CVPR
2005
IEEE
14 years 10 months ago
Matching with PROSAC - Progressive Sample Consensus
A new robust matching method is proposed. The Progressive Sample Consensus (PROSAC) algorithm exploits the linear ordering defined on the set of correspondences by a similarity fu...
Ondrej Chum, Jiri Matas
PODC
2012
ACM
11 years 11 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...