Sciweavers

271 search results - page 13 / 55
» Graph limits and parameter testing
Sort
View
FGR
1996
IEEE
117views Biometrics» more  FGR 1996»
14 years 2 months ago
Tracking and Learning Graphs and Pose on Image Sequences of Faces
We demonstrate a system capable of tracking, in real world image sequences, landmarks such as eyes, mouth, or chin on a face. In the standard version, knowledge previously collect...
Thomas Maurer, Christoph von der Malsburg
JOLLI
2006
86views more  JOLLI 2006»
13 years 9 months ago
Types as Graphs: Continuations in Type Logical Grammar
Applying the programming-language concept of continuations, we propose a new multimodal analysis of quantification in Type Logical Grammar. Our approach naturally gives rise to a n...
Chris Barker, Chung-chieh Shan
CPC
2002
80views more  CPC 2002»
13 years 9 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger
ICWS
2008
IEEE
13 years 11 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
CORR
2007
Springer
87views Education» more  CORR 2007»
13 years 10 months ago
Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
Animashree Anandkumar, Lang Tong, Ananthram Swami