4541 search results - page 642 / 909 » Cache-Oblivious Algorithms and Data Structures |
195
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
This paper proposes a new registration algorithm, Covariance Driven Correspondences (CDC), that depends fundamentally on the estimation of uncertainty in point correspondences. Th...
195
click to vote
ISNN
2009
Springer
16 years 1 months ago
2009
Springer
SM has shown a better performance than HMM in connected word recognition system; however, no reports we have read show that SM has been applied in LVCSR as decoding acoustic model ...
174
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
243
click to vote
SIGSOFT
1994
ACM
15 years 11 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
199
click to vote
ESOP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...