1046 search results - page 67 / 210 » Approximation Algorithms for Domination Search |
102
Voted
ISSAC
2009
Springer
15 years 7 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
91
Voted
SPIRE
2005
Springer
15 years 6 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
184
Voted
SIGMOD
2009
ACM
16 years 21 days ago
2009
ACM
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
CCR
2006
15 years 16 days ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
99
Voted
ICRA
2008
IEEE
15 years 7 months ago
2008
IEEE
— In this paper, we describe the components of a novel algorithm for the extraction of dominant orthogonal planar structures from monocular images taken in indoor environments. T...