Sciweavers

332 search results - page 30 / 67
» Compositions of Graphs Revisited
Sort
View
SOCO
2009
Springer
14 years 1 months ago
Lazy Composition of Representations in Java
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
Rémi Douence, Xavier Lorca, Nicolas Loriant
ICCV
2011
IEEE
12 years 7 months ago
Image Segmentation by Figure-Ground Composition into Maximal Cliques
We propose a mid-level statistical model for image segmentation that composes multiple figure-ground hypotheses (FG) obtained by applying constraints at different locations and s...
Adrian Ion, Joao Carreira, Cristian Sminchisescu
TAMC
2010
Springer
14 years 14 days ago
A Note on the Testability of Ramsey's Class
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
Charles Jordan, Thomas Zeugmann
CCGRID
2008
IEEE
13 years 9 months ago
Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
Sascha Hunold, Thomas Rauber, Frédér...
NETWORKING
2008
13 years 8 months ago
The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
Siyu Tang, Huijuan Wang, Piet Van Mieghem