4095 search results - page 520 / 819 » How to test a tree |
110
click to vote
AUSAI
2008
Springer
15 years 6 months ago
2008
Springer
The task of finding the optimum of some function f(x) is commonly accomplished by generating and testing sample solutions iteratively, choosing each new sample x heuristically on t...
134
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
150
click to vote
ACISP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this article we introduce redundant trinomials to represent elements of finite fields of characteristic 2. This paper develops applications to cryptography, especial...
144
click to vote
CSCW
2008
ACM
15 years 5 months ago
2008
ACM
Collaborative tagging systems have the potential to produce socially constructed information organization schemes. The effectiveness of tags for finding and re-finding information...
119
click to vote
ETRA
2008
ACM
15 years 5 months ago
2008
ACM
In this paper we evaluate several of the most popular algorithms for segmenting fixations from saccades by testing these algorithms on the scanning patterns of toddlers. We show t...