2492 search results - page 171 / 499 » On the General Signature Trees |
169
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
139
click to vote
AVI
2008
15 years 8 months ago
2008
In many applications transactions between the elements of an information hierarchy occur over time. For example, the product offers of a department store can be organized into pro...
193
click to vote
INFOSCALE
2007
ACM
15 years 8 months ago
2007
ACM
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
160
click to vote
AVI
2006
15 years 8 months ago
2006
We present an experiment that compares how people perform search tasks in a degree-of-interest browser and in a Windows-Explorer-like browser. Our results show that, whereas users...
157
click to vote
NIPS
2004
15 years 7 months ago
2004
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...