Sciweavers

449 search results - page 61 / 90
» Efficient use of local edge histogram descriptor
Sort
View
SOSP
2009
ACM
14 years 5 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
ICCV
2009
IEEE
15 years 1 months ago
Active Skeleton for Non-rigid Object Detection
We present a shape-based algorithm for detecting and recognizing non-rigid objects from natural images. The existing literature in this domain often cannot model the objects ver...
Xiang Bai, Xinggang Wang, Longin Jan Latecki, Weny...
CVPR
1996
IEEE
14 years 24 days ago
Global Minimum for Active Contour Models: A Minimal Path Approach
A new boundary detection approach for shape modeling is presented. It detects the global minimum of an active contour model's energy between two end points. Initialization is ...
Laurent D. Cohen, Ron Kimmel
TOG
2002
162views more  TOG 2002»
13 years 8 months ago
Interactive skeleton-driven dynamic deformations
This paper presents a framework for the skeleton-driven animation of elastically deformable characters. A character is embedded in a coarse volumetric control lattice, which provi...
Steve Capell, Seth Green, Brian Curless, Tom Ducha...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg