Sciweavers

9842 search results - page 1847 / 1969
» Problem complexity
Sort
View
110
Voted
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
15 years 1 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
203
Voted

Book
352views
16 years 10 months ago
Object-Oriented Reengineering Patterns
"The documentation is missing or obsolete, and the original developers have departed. Your team has limited understanding of the system, and unit tests are missing for many, i...
Serge Demeyer, Stéphane Ducasse, Oscar Nierstrasz
143
Voted
CVPR
2009
IEEE
16 years 8 months ago
Dense 3D Motion Capture for Human Faces
This paper proposes a novel approach to motion capture from multiple, synchronized video streams, specifically aimed at recording dense and accurate models of the structure and ...
Yasutaka Furukawa (University of Washington), Jean...
CVPR
2009
IEEE
16 years 7 months ago
Reducing JointBoost-Based Multiclass Classification to Proximity Search
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. Join...
Alexandra Stefan (University of Texas at Arlington...
101
Voted
CVPR
1998
IEEE
16 years 2 months ago
Incorporating Illumination Constraints in Deformable Models
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
Dimitris Samaras, Dimitris N. Metaxas
« Prev « First page 1847 / 1969 Last » Next »