Sciweavers

148 search results - page 18 / 30
» DisNet: A Framework for Distributed Graph Computation
Sort
View
CVPR
2004
IEEE
15 years 11 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov
ICALP
2005
Springer
15 years 3 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
ICPR
2006
IEEE
15 years 10 months ago
A Unified Formulation of Invariant Point Pattern Matching
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
Terry Caelli, Tibério S. Caetano
BMCBI
2005
120views more  BMCBI 2005»
14 years 9 months ago
SpectralNET - an application for spectral graph analysis and visualization
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...
Joshua J. Forman, Paul A. Clemons, Stuart L. Schre...
81
Voted
CLOUDCOM
2009
Springer
15 years 1 months ago
Cost-Minimizing Scheduling of Workflows on a Cloud of Memory Managed Multicore Machines
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
Nicolas G. Grounds, John K. Antonio, Jeffrey T. Mu...