Sciweavers

2386 search results - page 413 / 478
» Representing and Reasoning with Preferences
Sort
View
CORR
1998
Springer
113views Education» more  CORR 1998»
14 years 9 months ago
Letter to Sound Rules for Accented Lexicon Compression
This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compressi...
V. Pagel, Kevin Lenzo, Alan W. Black
JETAI
1998
110views more  JETAI 1998»
14 years 9 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
PAAPP
2002
76views more  PAAPP 2002»
14 years 9 months ago
Performance of PDE solvers on a self-optimizing NUMA architecture
Abstract. The performance of shared-memory (OpenMP) implementations of three different PDE solver kernels representing finite difference methods, finite volume methods, and spectra...
Sverker Holmgren, Markus Nordén, Jarmo Rant...
SAC
2008
ACM
14 years 9 months ago
Flexible pointer analysis using assign-fetch graphs
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...
INFOCOM
2010
IEEE
14 years 8 months ago
Bargaining and Price-of-Anarchy in Repeated Inter-Session Network Coding Games
— Most of the previous work on network coding has assumed that the users are not selfish and always follow the designed coding schemes. However, recent results have shown that s...
Amir Hamed Mohsenian Rad, Jianwei Huang, Vincent W...