Sciweavers

1054 search results - page 37 / 211
» Fast Approximated SIFT
Sort
View
INFOCOM
2008
IEEE
15 years 4 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
15 years 3 months ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer
ARITH
2007
IEEE
15 years 1 months ago
Efficient polynomial L-approximations
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
Nicolas Brisebarre, Sylvain Chevillard
81
Voted
CVPR
2007
IEEE
15 years 11 months ago
Learning Visual Similarity Measures for Comparing Never Seen Objects
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
Eric Nowak, Frédéric Jurie
ISBI
2008
IEEE
15 years 10 months ago
Sift-based sequence registration and flow-based cortical vessel segmentation applied to high resolution optical imaging data
Several functional and biomedical imaging techniques rely on determining hemodynamic variables and their changes in large vascular networks. To do so at micro-vascular resolution ...
Ivo Vanzetta, Mickaël Péchaud, Renaud ...