712 search results - page 103 / 143 » The Complexity of Constructing Evolutionary Trees Using Expe... |
113
Voted
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
CHI
2008
ACM
15 years 10 months ago
2008
ACM
A reliable and unobtrusive measurement of working memory load could be used to evaluate the efficacy of interfaces and to provide real-time user-state information to adaptive syst...
106
Voted
KBSE
2005
IEEE
15 years 3 months ago
2005
IEEE
Engineering distributed systems is a challenging activity. This is partly due to the intrinsic complexity of distributed systems, and partly due to the practical obstacles that de...
110
Voted
DASFAA
2007
IEEE
15 years 4 months ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
WIA
2000
Springer
15 years 1 months ago
2000
Springer
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...