2626 search results - page 324 / 526 » The complexity of stochastic sequences |
178
click to vote
ISAAC
2005
Springer
16 years 4 days ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
212
click to vote
NLDB
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. A large amount of biological knowledge today is only available from full-text research papers. Since neither manual database curators nor users can keep up with the rapid...
183
click to vote
SCALESPACE
2005
Springer
16 years 3 days ago
2005
Springer
Variational methods are very popular for optic flow computation: They yield dense flow fields and perform well if they are adapted such that they respect discontinuities in the ...
165
click to vote
ECLIPSE
2004
ACM
16 years 1 days ago
2004
ACM
Programming courses of all levels rely heavily on code examples. Often, to cover non-trivial subjects, it is convenient to present examples in the form of a tutorial. Such tutoria...
176
Voted
CIA
2004
Springer
16 years 21 hour ago
2004
Springer
Given a specification of communication rules in a multiagent system (in the form of protocols, ACL semantics, etc.), the question of how to design appropriate agents that can oper...