10419 search results - page 1906 / 2084 » Relational information gain |
190
click to vote
CIKM
1993
Springer
15 years 10 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
164
click to vote
IFIP
1994
Springer
15 years 10 months ago
1994
Springer
There have been innumerable glowing reports of the way hypermedia systems allow users to explore and use vast amounts of information in ways not possible using traditional informa...
215
click to vote
SIGMOD
1993
ACM
15 years 10 months ago
1993
ACM
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
235
click to vote
UIST
1993
ACM
15 years 10 months ago
1993
ACM
This paper describes the VB2 architecture for the construction of three-dimensional interactive applications. The system's state and behavior are uniformly represented as a n...
211
Voted
EBERNBURG
1990
15 years 10 months ago
1990
In the theory of living systems any description of self-organizing processes is confronted by a very central problem concerning the role of the system's boundary, i.e., there...