Sciweavers

1095 search results - page 142 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
CVGIP
2006
163views more  CVGIP 2006»
15 years 4 months ago
SVD-matching using SIFT features
The paper tackles the problem of feature points matching between pair of images of the same scene. This is a key problem in computer vision. The method we discuss here is a versio...
Elisabetta Delponte, Francesco Isgrò, Franc...
SIGIR
2006
ACM
15 years 10 months ago
Respect my authority!: HITS without hyperlinks, utilizing cluster-based language models
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
Oren Kurland, Lillian Lee
138
Voted
JSAC
2008
110views more  JSAC 2008»
15 years 4 months ago
Low complexity resource allocation with opportunistic feedback over downlink OFDMA networks
Abstract--Optimal tone allocation in downlink OFDMA networks is a non-convex NP-hard problem that requires extensive feedback for channel information. In this paper, two constantco...
Rajiv Agarwal, Vinay R. Majjigi, Zhu Han, Rath Van...
ISPDC
2007
IEEE
15 years 11 months ago
Whole Genome Comparison on a Network of Workstations
Whole genome comparison consists of comparing or aligning genome sequences with a goal of finding similarities between them. Previously we have shown how SIMD Extensions used in ...
Arpith C. Jacob, Sugata Sanyal, Marcin Paprzycki, ...
ICIP
2007
IEEE
15 years 6 months ago
Motion Estimation using Tangent Distance
In this paper, we present a method based on tangent distance to estimate motion in image sequences. Tangent distance combines an intuitive understanding and effective modeling of ...
Jonathan Fabrizio, Séverine Dubuisson