2219 search results - page 332 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
96
Voted
SIGITE
2005
ACM
15 years 8 months ago
2005
ACM
Educators have long been trying to spice things up in their introductory programming courses. Traditionally, twodimensional arrays have been taught non-graphically using contrived...
109
click to vote
MM
2006
ACM
15 years 8 months ago
2006
ACM
Recently, interactive image cutout technique becomes prevalent for image segmentation problem due to its easy-to-use nature. However, most existing stroke-based interactive object...
127
Voted
DIALM
2003
ACM
15 years 8 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
123
Voted
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
158
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...