Sciweavers

13621 search results - page 2690 / 2725
» Computability and Complexity in Self-assembly
Sort
View
CORR
2007
Springer
144views Education» more  CORR 2007»
14 years 11 months ago
Optimization of Information Rate Upper and Lower Bounds for Channels with Memory
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams
CPHYSICS
2007
71views more  CPHYSICS 2007»
14 years 11 months ago
Simulation of n-qubit quantum systems. III. Quantum operations
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
T. Radtke, S. Fritzsche
JMLR
2008
230views more  JMLR 2008»
14 years 11 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
JMLR
2008
168views more  JMLR 2008»
14 years 11 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
JACM
2006
99views more  JACM 2006»
14 years 11 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
« Prev « First page 2690 / 2725 Last » Next »