Sciweavers

1149 search results - page 172 / 230
» Minimally non-Pfaffian graphs
Sort
View
ICPR
2010
IEEE
14 years 9 months ago
Rectifying Non-Euclidean Similarity Data Using Ricci Flow Embedding
Similarity based pattern recognition is concerned with the analysis of patterns that are specified in terms of object dissimilarity or proximity rather than ordinal values. For man...
Weiping Xu, Edwin R. Hancock, Richard C. Wilson
SOCIALCOM
2010
14 years 9 months ago
The Dynamics of Two Cognitive Heuristics for Coordination on Networks
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
Iyad Rahwan, Fatemeh Jahedpari, Sherief Abdallah
ICIG
2009
IEEE
14 years 9 months ago
Statistical Modeling of Optical Flow
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...
Dongmin Ma, Véronique Prinet, Cyril Cassisa
IEEESCC
2009
IEEE
14 years 9 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
CORR
2010
Springer
178views Education» more  CORR 2010»
14 years 9 months ago
Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
Fen Zhou, Miklós Molnár, Bernard Cou...