4155 search results - page 244 / 831 » External Memory Algorithms |
188
click to vote
CICLING
2008
Springer
15 years 8 months ago
2008
Springer
Short texts clustering is one of the most difficult tasks in natural language processing due to the low frequencies of the document terms. We are interested in analysing these kind...
184
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
181
click to vote
KR
2004
Springer
16 years 8 hour ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
177
click to vote
ECRTS
2003
IEEE
15 years 12 months ago
2003
IEEE
The memory model used in the Real-Time Specification for Java (RTSJ) imposes strict assignment rules to or from memory areas preventing the creation of dangling pointers, and thus...
160
click to vote
SSDBM
1990
IEEE
15 years 10 months ago
1990
IEEE
In this paper we survey known results on algorithms, data structures, and some applications of random sampling from databases. We first discuss various reasons for sampling from d...