Sciweavers

6610 search results - page 998 / 1322
» Community Structures of Networks
Sort
View
MICCAI
2006
Springer
16 years 5 months ago
Logarithm Odds Maps for Shape Representation
The concept of the Logarithm of the Odds (LogOdds) is frequently used in areas such as artificial neural networks, economics, and biology. Here, we utilize LogOdds for a shape repr...
Kilian M. Pohl, John W. Fisher III, Martha Elizabe...
RECOMB
2003
Springer
16 years 4 months ago
A multi-expert system for the automatic detection of protein domains from sequence information
We describe a novel method for detecting the domain structure of a protein from sequence information alone. The method is based on analyzing multiple sequence alignments that are ...
Niranjan Nagarajan, Golan Yona
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 4 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
SOSP
2007
ACM
16 years 28 days ago
Sinfonia: a new paradigm for building scalable distributed systems
We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols—a major complication in existing distri...
Marcos Kawazoe Aguilera, Arif Merchant, Mehul A. S...
EUROPAR
2009
Springer
15 years 10 months ago
MPI Applications on Grids: A Topology Aware Approach
Porting on grids complex MPI applications involving collective communications requires significant program modification, usually dedicated to a single grid structure. The diffi...
Camille Coti, Thomas Hérault, Franck Cappel...