Sciweavers

1439 search results - page 102 / 288
» Fast approximation of centrality
Sort
View
ICIP
1999
IEEE
15 years 11 months ago
A Fast Algorithm for Rigid Structure from Image Sequences
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...
Pedro M. Q. Aguiar, José M. F. Moura
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
15 years 10 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
EDBT
2006
ACM
121views Database» more  EDBT 2006»
15 years 10 months ago
On Fast Non-metric Similarity Search by Metric Access Methods
Abstract. The retrieval of objects from a multimedia database employs a measure which defines a similarity score for every pair of objects. The measure should effectively follow th...
Tomás Skopal
ICPP
2008
IEEE
15 years 4 months ago
Fast Source Switching for Gossip-Based Peer-to-Peer Streaming
In this paper we consider gossip-based Peer-to-Peer streaming applications where multiple sources exist and they work serially. More specifically, we tackle the problem of fast s...
Zhenhua Li, Jiannong Cao, Guihai Chen, Yan Liu
SMA
2005
ACM
201views Solid Modeling» more  SMA 2005»
15 years 3 months ago
Fast and robust detection of crest lines on meshes
We propose a fast and robust method for detecting crest lines on surfaces approximated by dense triangle meshes. The crest lines, salient surface features defined via first- and...
Shin Yoshizawa, Alexander G. Belyaev, Hans-Peter S...