Sciweavers

272 search results - page 4 / 55
» Minimal Function Graphs are not Instrumented
Sort
View
EVOW
2010
Springer
14 years 16 days ago
A Genetic Algorithm to Minimize Chromatic Entropy
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
Greg Durrett, Muriel Médard, Una-May O'Reil...
ICRA
2007
IEEE
149views Robotics» more  ICRA 2007»
14 years 1 months ago
Model-based Motion Estimation of Elastic Surfaces for Minimally Invasive Cardiac Surgery
— In order to assist surgeons during surgery on moving organs, e.g. minimally invasive beating heart bypass surgery, a master-slave system which synchronizes surgical instruments...
Thomas Bader, Alexander Wiedemann, Kathrin Roberts...
DCC
2007
IEEE
14 years 7 months ago
Distributed Functional Compression through Graph Coloring
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
Devavrat Shah, Muriel Médard, Sidharth Jagg...
ICCV
1999
IEEE
14 years 9 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
ICCAD
1993
IEEE
81views Hardware» more  ICCAD 1993»
13 years 11 months ago
Inverter minimization in multi-level logic networks
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...
Alok Jain, Randal E. Bryant