Sciweavers

234 search results - page 4 / 47
» Isolation, Matching, and Counting
Sort
View
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
15 years 1 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
CORR
2010
Springer
111views Education» more  CORR 2010»
14 years 9 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
GCB
2000
Springer
75views Biometrics» more  GCB 2000»
15 years 1 months ago
Regexpcount, a Symbolic Package for Counting Problems on Regular Expressions and Words
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this w...
Pierre Nicodème
112
Voted
LATA
2009
Springer
15 years 4 months ago
Counting Parameterized Border Arrays for a Binary Alphabet
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
ICIP
1994
IEEE
15 years 11 months ago
Tracking and Counting Moving People
The development of a system able to detect and track moving people is described. Given a sequence of timevarying images, the goal is to count the number of people crossing a count...
M. Rossi, A. Bozzoli