Sciweavers

522 search results - page 68 / 105
» The 3-Steiner Root Problem
Sort
View
FOCS
2003
IEEE
14 years 2 months ago
Approximation Algorithms for Orienteering and Discounted-Reward TSP
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
Avrim Blum, Shuchi Chawla, David R. Karger, Terran...
GECCO
2004
Springer
114views Optimization» more  GECCO 2004»
14 years 2 months ago
A Study of the Role of Single Node Mutation in Genetic Programming
In this paper we examine the effects of single node mutations on trees evolved via genetic programming. The results show that neutral mutations are less likely for nodes nearer th...
Wei Quan, Terence Soule
CVPR
2009
IEEE
15 years 3 months ago
Max-Margin Hidden Conditional Random Fields for Human Action Recognition
We present a new method for classification with structured latent variables. Our model is formulated using the max-margin formalism in the discriminative learning literature. We...
Yang Wang 0003, Greg Mori
ICIP
2005
IEEE
14 years 10 months ago
Dependent bit allocation in multiview video coding
We consider the bit allocation problem in multiview video coding (MVC). A dependent coding technique using trellis expansion and the Viterbi algorithm (VA) is proposed, which take...
Jae Hoon Kim, Jonathan Garcia, Antonio Ortega
IPMI
2005
Springer
14 years 9 months ago
Design of Robust Vascular Tree Matching: Validation on Liver
Abstract. In this paper, we propose an original and efficient tree matching algorithm for intra-patient hepatic vascular system registration. Vascular systems are segmented from CT...
Arnaud Charnoz, Vincent Agnus, Grégoire Mal...