Sciweavers

106 search results - page 18 / 22
» Further Results on Swarms Solving Graph Coloring
Sort
View
LION
2007
Springer
138views Optimization» more  LION 2007»
14 years 1 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
ASPDAC
2009
ACM
113views Hardware» more  ASPDAC 2009»
13 years 10 months ago
Post-routing redundant via insertion with wire spreading capability
—Redundant via insertion is a widely recommended technique to enhance the via yield and reliability. In this paper, the post-routing redundant via insertion problem is transforme...
Cheok-Kei Lei, Po-Yi Chiang, Yu-Min Lee
ISBI
2011
IEEE
12 years 11 months ago
Exact integration of diffusion orientation distribution functions for graph-based diffusion MRI analysis
Graph-based image analysis methods are increasingly being applied to diffusion MRI (dMRI) analysis. Unfortunately, weighting the graph for these methods involves solving a complex...
Brian G. Booth, Ghassan Hamarneh
PAMI
2006
135views more  PAMI 2006»
13 years 7 months ago
Real-Time Range Acquisition by Adaptive Structured Light
The goal of this paper is to provide a "self-adaptive" system for real-time range acquisition. Reconstructions are based on a single frame structured light illumination. ...
Thomas P. Koninckx, Luc J. Van Gool
CVPR
2008
IEEE
14 years 9 months ago
FusionFlow: Discrete-continuous optimization for optical flow estimation
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...
Victor S. Lempitsky, Stefan Roth, Carsten Rother