Sciweavers

6274 search results - page 1229 / 1255
» From query complexity to computational complexity
Sort
View
118
Voted
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 3 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
133
Voted
CLASSIFICATION
2006
108views more  CLASSIFICATION 2006»
15 years 3 months ago
The Practice of Cluster Analysis
Abstracts "Mixtures at the Interface" David Scott, Rice University Mixture modeling provides an effective framework for complex, high-dimensional data. The potential of m...
Jon R. Kettenring
169
Voted
JMLR
2008
230views more  JMLR 2008»
15 years 3 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...
JACM
2006
99views more  JACM 2006»
15 years 3 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
164
Voted
IANDC
2007
152views more  IANDC 2007»
15 years 3 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
« Prev « First page 1229 / 1255 Last » Next »