Sciweavers

4007 search results - page 514 / 802
» Computation with imprecise probabilities
Sort
View
ACCV
2009
Springer
16 years 1 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
16 years 1 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman
ISEUD
2009
Springer
16 years 1 months ago
What Is End-User Software Engineering and Why Does It Matter?
End-user programming has become ubiquitous, so much so that there are more end-user programmers today than there are professional programmers. End-user programming empowers—but t...
Margaret M. Burnett
ISVC
2009
Springer
16 years 1 months ago
Weight, Sex, and Facial Expressions: On the Manipulation of Attributes in Generative 3D Face Models
Generative 3D Face Models are expressive models with applications in modelling and editing. They are learned from example faces, and offer a compact representation of the continuou...
Brian Amberg, Pascal Paysan, Thomas Vetter
KIVS
2009
Springer
16 years 1 months ago
Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems
In the context of large decentralized many-to-many communication systems it is impractical to provide realistic and hard bounds for certain QoS metrics including latency bounds. Ne...
M. Adnan Tariq, Boris Koldehofe, Gerald G. Koch, K...