843 search results - page 98 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
119
click to vote
AAAI
2007
15 years 3 months ago
2007
Partially Observable Markov Decision Processes (POMDPs) provide an appropriately rich model for agents operating under partial knowledge of the environment. Since finding an opti...
134
click to vote
ADT
2005
15 years 1 months ago
2005
In this paper we present a new framework, based on subdivision surface approximation, for efficient compression and coding of 3D models represented by polygonal meshes. Our algorit...
120
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
139
click to vote
NETWORKING
2007
15 years 3 months ago
2007
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
112
click to vote
CIBCB
2007
IEEE
15 years 8 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...