3360 search results - page 309 / 672 » Opportunistic Data Structures with Applications |
163
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
145
Voted
ARC
2008
Springer
15 years 7 months ago
2008
Springer
We present an improved method for scheduling speculative data paths which relies on cancel tokens to undo computations in misspeculated paths. Performancewise, this method is consi...
132
click to vote
ACL
2008
15 years 6 months ago
2008
The focus of this study is positive feedback in one-on-one tutoring, its computational modeling, and its application to the design of more effective Intelligent Tutoring Systems. ...
136
click to vote
ALGORITHMICA
2005
15 years 5 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
173
Voted
CLUSTER
2005
IEEE
15 years 10 months ago
2005
IEEE
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...