1021 search results - page 21 / 205 » Fast Approximate PCPs |
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
SCAM
2007
IEEE
14 years 2 months ago
2007
IEEE
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
SPAA
2010
ACM
14 years 16 days ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...