1749 search results - page 168 / 350 » Conditional colorings of graphs |
175
click to vote
PROCEDIA
2010
15 years 1 months ago
2010
In this work we address the issue of selecting and composing Web Services (WSs) considering functional requirements and transactional properties. We formalize the WS composition p...
200
click to vote
TAICPART
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract. Writing multithreaded software for multicore computers confronts many developers with the difficulty of finding parallel programming errors. In the past, most parallel d...
186
click to vote
GD
1995
Springer
15 years 10 months ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
201
click to vote
TVCG
2008
15 years 6 months ago
2008
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
197
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
The standard graph cut technique is a robust method for globally optimal image segmentations. However, because of its global nature, it is prone to capture outlying areas similar ...