Search Sciweavers | Sciweavers

1054 search results - page 23 / 211

» Fast Approximated SIFT

click to vote

ICCSA
2004
Springer

106views Applied Computing» more ICCSA 2004»

A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes

15 years 3 months ago

Download www.sm.luth.se

Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...

Håkan Jonsson

claim paper

Read More »

115

click to vote

JCDCG
2004
Springer

147views Discrete Geometry» more JCDCG 2004»

The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation

15 years 3 months ago

Download i11www.iti.uni-karlsruhe.de

Marc Benkert, Alexander Wolff, Florian Widmann

claim paper

Read More »

click to vote

CIKM
2009
Springer

150views Information Technology» more CIKM 2009»

Fast centrality approximation in modular networks

15 years 2 months ago

Download www.dcs.bbk.ac.uk

Shu Yan Chan, Ian X. Y. Leung, Pietro Liò

claim paper

Read More »

click to vote

STOC
1999
ACM

104views Algorithms» more STOC 1999»

Fast Approximate PCPs

15 years 1 months ago

Download www.cs.princeton.edu

We investigate the question of when a prover can aid a veriﬁer to reliably compute a function faster than if the veriﬁer were to compute the function on its own. Our focus is ...

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld

claim paper

Read More »

click to vote

CPM
1999
Springer

105views Combinatorics» more CPM 1999»

Fast Multi-dimensional Approximate Pattern Matching

15 years 1 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers