Sciweavers

2754 search results - page 81 / 551
» Distributed Weighted Matching
Sort
View
IS
2007
13 years 10 months ago
Matching large schemas: Approaches and evaluation
Current schema matching approaches still have to improve for large and complex Schemas. The large search space increases the likelihood for false matches as well as execution time...
Hong Hai Do, Erhard Rahm
DEBS
2007
ACM
14 years 22 days ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
PODC
2009
ACM
14 years 11 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
CSL
2002
Springer
13 years 10 months ago
Weighted finite-state transducers in speech recognition
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
Mehryar Mohri, Fernando Pereira, Michael Riley
CPC
2008
74views more  CPC 2008»
13 years 11 months ago
An Analysis of the Height of Tries with Random Weights on the Edges
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
Nicolas Broutin, Luc Devroye