Sciweavers

545 search results - page 9 / 109
» Estimating the Probability of Approximate Matches
Sort
View
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
13 years 11 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
KI
1997
Springer
13 years 11 months ago
Fast Grid-Based Position TRacking for Mobile Robots
One of the fundamental problems in the eld of mobile robotics is the estimation of the robot's position in the environment. Position probability grids have been proven to be a...
Wolfram Burgard, Dieter Fox, Daniel Hennig
IPMI
2007
Springer
14 years 8 months ago
Active Mean Fields: Solving the Mean Field Approximation in the Level Set Framework
Abstract. We describe a new approach for estimating the posterior probability of tissue labels. Conventional likelihood models are combined with a curve length prior on boundaries,...
Kilian M. Pohl, Ron Kikinis, William M. Wells III
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
13 years 11 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
FUIN
2006
98views more  FUIN 2006»
13 years 7 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson