215 search results - page 31 / 43 » On extremal k-outconnected graphs |
AI
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
SIGCOMM
2004
ACM
14 years 24 days ago
2004
ACM
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
GECCO
2003
Springer
14 years 18 days ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Higher order energy functions have the ability to encode
high level structural dependencies between pixels, which
have been shown to be extremely powerful for image labeling
pro...