1162 search results - page 73 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
WINET
2010
13 years 6 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
IAT
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
ICCD
2007
IEEE
14 years 5 months ago
2007
IEEE
Floating-point division is an important operation in scientific computing and multimedia applications. This paper presents and compares two division algorithms for an x86 micropro...