Sciweavers

2142 search results - page 102 / 429
» Improved Conditional E-Payments
Sort
View
MP
2006
88views more  MP 2006»
15 years 3 months ago
Bounds on linear PDEs via semidefinite optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
Dimitris Bertsimas, Constantine Caramanis
137
Voted
APPML
2002
89views more  APPML 2002»
15 years 3 months ago
Average sampling in spline subspaces
Let V () be a shift invariant subspace of L2 (R) generated by a Riesz or frame generator (t) in L2 (R). We assume that (t) is suitably chosen so that the regular sampling expansio...
Wenchang Sun, Xingwei Zhou
NAACL
2010
15 years 1 months ago
Investigations into the Crandem Approach to Word Recognition
We suggest improvements to a previously proposed framework for integrating Conditional Random Fields and Hidden Markov Models, dubbed a Crandem system (2009). The previous authors...
Rohit Prabhavalkar, Preethi Jyothi, William Hartma...
SIGDIAL
2010
15 years 1 months ago
Cross-Domain Speech Disfluency Detection
We build a model for speech disfluency detection based on conditional random fields (CRFs) using the Switchboard corpus. This model is then applied to a new domain without any ada...
Kallirroi Georgila, Ning Wang, Jonathan Gratch
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
14 years 10 months ago
A lower bound for distributed averaging algorithms on the line graph
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
Alexander Olshevsky, John N. Tsitsiklis