4850 search results - page 532 / 970 » Approximate Data Structures with Applications |
184
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
A novel algorithm for robustly segmenting changes between different images of a scene is presented. This computationally efficient algorithm is based on a non-linear comparison of...
202
click to vote
VLDB
2004
ACM
16 years 17 days ago
2004
ACM
We investigate the problem of ranking answers to a database query when many tuples are returned. We adapt and apply principles of probabilistic models from Information Retrieval f...
212
click to vote
CPM
2006
Springer
15 years 11 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 ...
189
click to vote
ARC
2008
Springer
15 years 9 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...
182
click to vote
ACL
2008
15 years 8 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. ...