Sciweavers

1272 search results - page 60 / 255
» Approximate Parameterized Matching
Sort
View
SOFSEM
2010
Springer
15 years 8 months ago
On the Complexity of the Highway Pricing Problem
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...
Alexander Grigoriev, Joyce van Loon, Marc Uetz
71
Voted
ICCV
1998
IEEE
16 years 1 months ago
Representation and Self-Similarity of Shapes
Representing shapes is a signi cant problem for vision systems that must recognize or classify objects. We derive a representation for a given shape by investigating its self-simi...
Tyng-Luh Liu, Davi Geiger, Robert Kohn
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
15 years 2 months ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
15 years 4 months ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
CSFW
2007
IEEE
15 years 5 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini