Sciweavers

627 search results - page 7 / 126
» Branched Polyhedral Systems
Sort
View
CVPR
2010
IEEE
16 years 5 days ago
Polynomial Shape from Shading
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
Ady Ecker, Allan Jepson
ISCA
2007
IEEE
115views Hardware» more  ISCA 2007»
16 years 24 days ago
VPC prediction: reducing the cost of indirect branches via hardware-based dynamic devirtualization
Indirect branches have become increasingly common in modular programs written in modern object-oriented languages and virtualmachine based runtime systems. Unfortunately, the pred...
Hyesoon Kim, José A. Joao, Onur Mutlu, Chan...
ICSM
2009
IEEE
16 years 1 months ago
Comparative analysis of evolving software systems using the Gini coefficient
Rajesh Vasa, Markus Lumpe, Philip Branch, Oscar Ni...
ENTCS
2008
115views more  ENTCS 2008»
15 years 6 months ago
Branching Bisimulation Congruence for Probabilistic Systems
The notion of branching bisimulation for the alternating model of probabilistic systems is not a congruence with respect to parallel composition. In this paper we first define ano...
Nikola Trcka, Sonja Georgievska
ECCV
2002
Springer
16 years 8 months ago
Principal Component Analysis over Continuous Subspaces and Intersection of Half-Spaces
Abstract. Principal Component Analysis (PCA) is one of the most popular techniques for dimensionality reduction of multivariate data points with application areas covering many bra...
Anat Levin, Amnon Shashua