Sciweavers

5473 search results - page 730 / 1095
» On the graph isomorphism problem
Sort
View
ECCV
2008
Springer
16 years 8 months ago
Anisotropic Geodesics for Perceptual Grouping and Domain Meshing
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
Sébastien Bougleux, Gabriel Peyré, L...
ATAL
2008
Springer
15 years 8 months ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...
JCB
2006
125views more  JCB 2006»
15 years 6 months ago
Hypothesis Generation in Signaling Networks
Biological signaling networks comprise the chemical processes by which cells detect and respond to changes in their environment. Such networks have been implicated in the regulati...
Derek A. Ruths, Luay Nakhleh, M. Sriram Iyengar, S...
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
16 years 1 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák
LICS
2005
IEEE
16 years 9 days ago
Uniform Distributed Synthesis
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
Bernd Finkbeiner, Sven Schewe