7264 search results - page 144 / 1453 » A multiplicative up-propagation algorithm |
141
click to vote
IROS
2009
IEEE
15 years 11 months ago
2009
IEEE
— This paper describes a model-based probabilistic framework for tracking a fleet of laboratory-scale underwater vehicles using multiple fixed cameras. We model the target moti...
147
click to vote
ICIC
2009
Springer
15 years 11 months ago
2009
Springer
Sequence Alignment is a basic information disposal method in Bioinformatics. However, it is difficult to deal with multiple sequence alignment problem(MSA). In this paper, an impro...
121
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
152
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
191
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Object-based segmentation is a challenging topic. Most of the previous algorithms focused on segmenting a single or a small set of objects. In this paper, the multiple class objec...