332 search results - page 25 / 67 » Complexity analysis of a decentralised graph colouring algor... |
120
click to vote
SIGECOM
2005
ACM
15 years 8 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
146
click to vote
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
149
click to vote
ICASSP
2010
IEEE
15 years 3 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...
122
click to vote
PODC
2009
ACM
16 years 3 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
140
click to vote
WAW
2007
Springer
15 years 9 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...