712 search results - page 75 / 143 » The Complexity of Constructing Evolutionary Trees Using Expe... |
122
click to vote
WSC
2004
15 years 4 months ago
2004
Monte Carlo techniques have long been used (since Buffon's experiment to approximate the value of by tossing a needle onto striped paper) to analyze phenomena which, due to ...
160
Voted
COLT
2010
Springer
15 years 1 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
109
click to vote
CG
2002
Springer
15 years 2 months ago
2002
Springer
The difficulty to write successful 19x19 go programs lies not only in the combinatorial complexity of go but also in the complexity of designing a good evaluation function containi...
142
click to vote
DOCENG
2006
ACM
15 years 9 months ago
2006
ACM
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
110
click to vote
FC
2010
Springer
15 years 7 months ago
2010
Springer
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...