17541 search results - page 3192 / 3509 » Complexity in scalable computing |
156
click to vote
AAAI
2011
14 years 6 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
168
click to vote
CCP
2011
14 years 6 months ago
2011
This project will involve analysing some of the newer fast algorithms in comparison with an exhaustive full search algorithm for motion estimation in video encoders. It will invest...
189
Voted
CATA
2000
15 years 7 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
230
click to vote
FROCOS
2011
Springer
14 years 5 months ago
2011
Springer
Temporal data models have been used to describe how data can evolve in the context of temporal databases. Both the Extended Entity-Relationship (EER) model and the Unified Modelli...
193
click to vote
HISB
2011
14 years 5 months ago
2011
— This paper presents a new cellular automata-based unsupervised image segmentation technique that is motivated by the interactive grow-cut algorithm. In contrast to the traditio...