Sciweavers

87 search results - page 2 / 18
» Limits of dense graph sequences
Sort
View
ICCV
2007
IEEE
14 years 7 months ago
Correspondence labelling for wide-timeframe free-form surface matching
This paper addresses the problem of estimating dense correspondence between arbitrary frames from captured sequences of shape and appearance for surfaces undergoing free-form defo...
Jonathan Starck, Adrian Hilton
AIPR
2001
IEEE
13 years 9 months ago
Model-Based Face Tracking for Dense Motion Field Estimation
When estimating the dense motion field of a video sequence, if little is known or assumed about the content, a limited constraint approach such as optical flow must be used. Since...
Timothy F. Gee, Russell M. Mersereau
TIT
2010
82views Education» more  TIT 2010»
12 years 12 months ago
Average message delivery time for small-world networks in the continuum limit
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
Hazer Inaltekin, Mung Chiang, H. Vincent Poor
JUCS
2008
147views more  JUCS 2008»
13 years 5 months ago
Authoring Courses with Rich Adaptive Sequencing for IMS Learning Design
: This paper describes the process of translating an adaptive sequencing strategy designed using Sequencing Graphs to the semantics of IMS Learning Design. The relevance of this co...
Sergio Gutiérrez Santos, Abelardo Pardo, Ca...
FORMATS
2004
Springer
13 years 10 months ago
Lazy Approximation for Dense Real-Time Systems
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
Maria Sorea