1021 search results - page 86 / 205 » Fast Approximate PCPs |
122
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
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 ...
124
Voted
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
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...
132
click to vote
ICPP
2008
IEEE
15 years 9 months ago
2008
IEEE
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...
132
click to vote
SMA
2005
ACM
15 years 8 months ago
2005
ACM
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...
126
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...