806 search results - page 98 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
ICCV
2005
IEEE
15 years 7 months ago
2005
IEEE
This study addresses the problem of unsupervised visual learning. It examines existing popular model order selection criteria before proposes two novel criteria for improving visu...
121
click to vote
ORL
2000
15 years 1 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
108
click to vote
HT
1998
ACM
15 years 5 months ago
1998
ACM
The presentation layer of hypermedia systems could benefit from standard object querying functionality and this is most effective if strong typing is enforced. By strong typing we...
110
click to vote
SIGMOD
1998
ACM
15 years 5 months ago
1998
ACM
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
132
click to vote
CIKM
2004
Springer
15 years 5 months ago
2004
Springer
With the tremendous growth of system memories, memoryresident databases are increasingly becoming important in various domains. Newer memories provide a structured way of storing ...