Sciweavers

408 search results - page 46 / 82
» Efficient and Robust Computation of Resource Clusters in the...
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
Marius Leordeanu, Martial Hebert
CLUSTER
2004
IEEE
13 years 7 months ago
DyRAM: An Active Reliable Multicast Framework for Data Distribution
Group communications (multicast) are foreseen to be one of the most critical yet challenging technologies to meet the exponentially growing demands for data distribution in a large...
Moufida Maimour, CongDuc Pham
IPPS
2003
IEEE
14 years 25 days ago
A GRASP-Based Algorithm for Solving DVE Partitioning Problem
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
Pedro Morillo, Marcos Fernández
WWW
2007
ACM
14 years 8 months ago
Comparing apples and oranges: normalized pagerank for evolving graphs
PageRank is the best known technique for link-based importance ranking. The computed importance scores, however, are not directly comparable across different snapshots of an evolv...
Klaus Berberich, Srikanta J. Bedathur, Gerhard Wei...
ECCV
2008
Springer
14 years 9 months ago
Modeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs
This paper presents an approach for modeling landmark sites such as the Statue of Liberty based on large-scale contaminated image collections gathered from the Internet. Our system...
Xiaowei Li, Changchang Wu, Christopher Zach, Svetl...