Sciweavers

3270 search results - page 66 / 654
» Approximate String Processing
Sort
View
FOCS
2005
IEEE
14 years 1 months ago
The Closest Substring problem with small distances
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
Dániel Marx
VLDB
2005
ACM
120views Database» more  VLDB 2005»
14 years 1 months ago
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
Jost Enderle, Nicole Schneider, Thomas Seidl
CICLING
2007
Springer
14 years 1 months ago
Handling Conjunctions in Named Entities
Although the literature contains reports of very high accuracy figures for the recognition of named entities in text, there are still some named entity phenomena that remain probl...
Robert Dale, Pawel P. Mazur
ICML
2004
IEEE
14 years 8 months ago
Variational methods for the Dirichlet process
Variational inference methods, including mean field methods and loopy belief propagation, have been widely used for approximate probabilistic inference in graphical models. While ...
David M. Blei, Michael I. Jordan