2520 search results - page 375 / 504 » The complexity of approximating entropy |
137
click to vote
JACM
2006
15 years 4 months ago
2006
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...
156
click to vote
JCC
2006
15 years 4 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
163
click to vote
KAIS
2008
15 years 4 months ago
2008
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
167
click to vote
SMA
2008
ACM
15 years 4 months ago
2008
ACM
We present an alternative approach to standard geometric shape editing using physically-based simulation. With our technique, the user can deform complex objects in real-time. The...
140
click to vote
JALC
2007
15 years 4 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...