Sciweavers

15485 search results - page 2627 / 3097
» Computing Optimal Subsets
Sort
View
CVGIP
2006
75views more  CVGIP 2006»
15 years 7 months ago
Momentum-based parameterization of dynamic character motion
This paper presents a system for rapid editing of highly dynamic motion capture data. At the heart of this system is an optimization algorithm that can transform the captured moti...
Yeuhi Abe, C. Karen Liu, Zoran Popovic
CN
2007
111views more  CN 2007»
15 years 7 months ago
An auction mechanism for allocating the bandwidth of networks to their users
We present a mechanism for auctioning bandwidth on a network-wide basis to end users or ISPs that will utilize it for the same time period. This mechanism consists of a set of sim...
Manos Dramitinos, George D. Stamoulis, Costas Cour...
IJCV
2006
261views more  IJCV 2006»
15 years 7 months ago
Non-Rigid Stereo Factorization
In this paper we address the problem of recovering 3D non-rigid structure from a sequence of images taken with a stereo pair. We have extended existing non-rigid factorization algo...
Alessio Del Bue, Lourdes de Agapito
IJCV
2006
299views more  IJCV 2006»
15 years 7 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
« Prev « First page 2627 / 3097 Last » Next »