Sciweavers

1388 search results - page 219 / 278
» Querying Linguistic Trees
Sort
View
ICASSP
2011
IEEE
14 years 4 months ago
Informative dialect recognition using context-dependent pronunciation modeling
We propose an informative dialect recognition system that learns phonetic transformation rules, and uses them to identify dialects. A hidden Markov model is used to align referenc...
Nancy F. Chen, Wade Shen, Joseph P. Campbell, Pedr...
COLING
2002
15 years 10 days ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
ICDE
2002
IEEE
102views Database» more  ICDE 2002»
16 years 1 months ago
Cost Models for Overlapping and Multi-Version B-Trees
Overlapping and multi-version techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databas...
Yufei Tao, Dimitris Papadias, Jun Zhang
ECIR
2009
Springer
15 years 9 months ago
Exploiting Visual Concepts to Improve Text-Based Image Retrieval
In this paper, we study how to automatically exploit visual concepts in a text-based image retrieval task. First, we use Forest of Fuzzy Decision Trees (FFDTs) to automatically ann...
Sabrina Tollari, Marcin Detyniecki, Christophe Mar...
123
Voted
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 7 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...