20441 search results - page 3720 / 4089 » Locally Computable Structures |
161
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
121
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
139
click to vote
CSCW
2006
ACM
15 years 8 months ago
2006
ACM
We analyze collaborative play in an online video game, World of Warcraft, the most popular personal computer game in the United States, with significant markets in Asia and Europe...
146
click to vote
DASFAA
2006
IEEE
15 years 8 months ago
2006
IEEE
Sharing of common subtrees has been reported useful not only for XML compression but also for main-memory XML query processing. This method compresses subtrees only when they exhib...
145
click to vote
DEXA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...