Sciweavers

458 search results - page 31 / 92
» Totally magic graphs
Sort
View
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 8 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
HPDC
2007
IEEE
14 years 2 months ago
Feedback-directed thread scheduling with memory considerations
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
Fengguang Song, Shirley Moore, Jack Dongarra
ICRA
1999
IEEE
138views Robotics» more  ICRA 1999»
14 years 15 hour ago
Efficient Topological Exploration
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
Ioannis M. Rekleitis, Vida Dujmovic, Gregory Dudek
ICPR
2010
IEEE
13 years 11 months ago
Kernel-Based Implicit Regularization of Structured Objects
Weighted graph regularization provides a rich framework that allows to regularize functions defined over the vertices of a weighted graph. Until now, such a framework has been only...
François-Xavier Dupé, Sébastien Bougleux, Luc B...
CCE
2006
13 years 7 months ago
New approaches for representing, analyzing and visualizing complex kinetic transformations
Complex kinetic mechanisms involving thousands of reacting species and tens of thousands of reactions are currently required for the rational analysis of modern combustion systems...
Ioannis P. Androulakis