Sciweavers

4201 search results - page 54 / 841
» Interaction graphs: Additives
Sort
View
ECCV
2004
Springer
16 years 8 months ago
Interactive Image Segmentation Using an Adaptive GMMRF Model
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
Andrew Blake, Carsten Rother, M. Brown, Patrick P&...
BMCBI
2010
183views more  BMCBI 2010»
15 years 6 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
152
Voted
CERA
2006
36views more  CERA 2006»
15 years 6 months ago
Federated Grid Computing with Interactive Service-oriented Programing
er.sagepub.com/cgi/content/abstract/14/1/55 The online version of this article can be found at: Published by: http://www.sagepublications.com can be found at:Concurrent Engineering...
Michael W. Sobolewski, Raymond M. Kolonay
COMBINATORICS
2007
42views more  COMBINATORICS 2007»
15 years 6 months ago
Graphs with Chromatic Roots in the Interval (1, 2)
We present an infinite family of 3-connected non-bipartite graphs with chromatic roots in the interval (1, 2) thus resolving a conjecture of Jackson’s in the negative. In addit...
Gordon F. Royle
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan