Sciweavers

3674 search results - page 585 / 735
» Information Dependencies
Sort
View
TKDE
1998
142views more  TKDE 1998»
15 years 6 months ago
Performance Analysis of Three Text-Join Algorithms
—When a multidatabase system contains textual database systems (i.e., information retrieval systems), queries against the global schema of the multidatabase system may contain a ...
Weiyi Meng, Clement T. Yu, Wei Wang 0010, Naphtali...
TASLP
2002
110views more  TASLP 2002»
15 years 6 months ago
Automatic generation of subword units for speech recognition systems
Large vocabulary continuous speech recognition (LVCSR) systems traditionally represent words in terms of smaller subword units. Both during training and during recognition, they re...
Rita Singh, Bhiksha Raj, Richard M. Stern
TASLP
2002
82views more  TASLP 2002»
15 years 6 months ago
Graceful degradation of speech recognition performance over packet-erasure networks
Abstract--This paper explores packet loss recovery for automatic speech recognition (ASR) in spoken dialog systems, assuming an architecture in which a lightweight client communica...
Constantinos Boulis, Mari Ostendorf, Eve A. Riskin...
TOIS
2002
97views more  TOIS 2002»
15 years 6 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 6 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg