On the Power of Local Orientations

13 years 6 months ago

Download people.ksp.sk

We consider a network represented by a simple connected undirected graph with N anonymous nodes that have local orientations, i.e. incident edges of each vertex have locally-unique labels

Monika Steinová

Real-time Traffic

Algorithm | Connected Undirected Graph | Information Technology | Local Orientations | SIROCCO 2008 |

claim paper

» Generalized MPU Implicits Using Belief Propagation

» Image Feature Extraction Using Gradient Local AutoCorrelations

» Local Steerable Phase LSP Feature for Face Representation and Recognition

» WLD A Robust Local Image Descriptor

» Local anisotropy analysis for nonsmooth images

» A robust descriptor based on Webers Law

» An evaluation of code and data optimizations in the context of disk power reduction

» Refactoring Middleware Systems A Case Study

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	SIROCCO
Authors	Monika Steinová

Comments (0)

Sciweavers

On the Power of Local Orientations

Algorithm | Connected Undirected Graph | Information Technology | Local Orientations | SIROCCO 2008 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers