Sciweavers

621 search results - page 14 / 125
» Global partial orders from sequential data
Sort
View
RSA
2010
107views more  RSA 2010»
14 years 8 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
ICDAR
2005
IEEE
15 years 3 months ago
A Novel Approach to Recover Writing Order From Single Stroke Offline Handwritten Images
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
Yu Qiao, Makoto Yasuhara
COMPENG
2010
178views Algorithms» more  COMPENG 2010»
14 years 4 months ago
Online Distributed Interdependency Estimation with Partial Information Sharing
Infrastructures are becoming more and more interoperable, while stakeholders are not aware of the overall behavior. In order achieve a global awareness, in this paper the need for ...
Andrea Gasparri, Francesco Iovino, Gabriele Oliva,...
81
Voted
ISM
2005
IEEE
151views Multimedia» more  ISM 2005»
15 years 3 months ago
Video Data Mining: Mining Semantic Patterns with temporal constraints from Movies
— For efficient video data management, ‘video data mining’ is required to discover ‘semantic patterns’ which are not only previously unknown and interesting, but also as...
Kimiaki Shirahama, Koichi Ideno, Kuniaki Uehara
TWC
2010
14 years 4 months ago
Distributed Node Selection for Sequential Estimation over Noisy Communication Channels
This paper proposes a framework for distributed sequential parameter estimation in wireless sensor networks. In the proposed scheme, the estimator is updated sequentially at the c...
Thakshila Wimalajeewa, Sudharman K. Jayaweera