Sciweavers

391 search results - page 23 / 79
» als 2003
Sort
View
FAW
2009
Springer
144views Algorithms» more  FAW 2009»
14 years 1 months ago
Communication Complexity and Its Applications
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
Andrew Chi-Chih Yao
STACS
2009
Springer
14 years 1 months ago
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
Andre Gronemeier
IJBRA
2006
111views more  IJBRA 2006»
13 years 8 months ago
Memory efficient alignment between RNA sequences and stochastic grammar models of pseudoknots
: Stochastic Context-Free Grammars (SCFG) has been shown to be effective in modelling RNA secondary structure for searches. Our previous work (Cai et al., 2003) in Stochastic Paral...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Co...
CORR
2007
Springer
150views Education» more  CORR 2007»
13 years 8 months ago
A Unified Framework for Pricing Credit and Equity Derivatives
We propose a model which can be jointly calibrated to the corporate bond term structure and equity option volatility surface of the same company. Our purpose is to obtain explicit...
Erhan Bayraktar, Bo Yang
NAACL
2010
13 years 6 months ago
Softmax-Margin CRFs: Training Log-Linear Models with Cost Functions
We describe a method of incorporating taskspecific cost functions into standard conditional log-likelihood (CLL) training of linear structured prediction models. Recently introduc...
Kevin Gimpel, Noah A. Smith