412 search results - page 10 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
84
Voted
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions i...
COLT
1999
Springer
15 years 1 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
JMLR
2012
12 years 12 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
71
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We describe a new approach for phoneme recognition which aims at minimizing the phoneme error rate. Building on structured prediction techniques, we formulate the phoneme recogniz...
79
Voted
ICSM
2007
IEEE
15 years 3 months ago
2007
IEEE
Libre (free / open source) software development is a complex phenomenon. Many actors (core developers, casual contributors, bug reporters, patch submitters, users, etc.), in many ...