Sciweavers

721 search results - page 87 / 145
» Graphs with Large Obstacle Numbers
Sort
View
IWCMC
2006
ACM
14 years 3 months ago
Performance of Taroko: a cluster-based addressing and routing scheme for self-organized networks
Self-Organized Networks (SONs) are a general description of autonomous networks without infrastructure, of which Ad Hoc, Sensor and Mesh networks are special cases. We had previou...
Julien Ridoux, Meriem Kassar, Mathias Boc, Anne Fl...
BIBE
2005
IEEE
154views Bioinformatics» more  BIBE 2005»
14 years 2 months ago
Effective Pre-Processing Strategies for Functional Clustering of a Protein-Protein Interactions Network
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) ne...
Duygu Ucar, Srinivasan Parthasarathy, Sitaram Asur...
ICDAR
2005
IEEE
14 years 2 months ago
Distinguishing Mathematics Notation from English Text using Computational Geometry
A trainable method for distinguishing between mathematics notation and natural language (here, English) in images of textlines, using computational geometry methods only with no a...
Derek M. Drake, Henry S. Baird
FTRTFT
1998
Springer
14 years 1 months ago
A Modular Visual Model for Hybrid Systems
Visual description techniques are particularly important for the design of hybrid systems because specifications of such systems must usually be discussed between engineers from a ...
Radu Grosu, Thomas Stauner, Manfred Broy
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 10 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen