Sciweavers

3204 search results - page 201 / 641
» The Alcuin Number of a Graph
Sort
View
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
16 years 17 days ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
INFOCOM
2008
IEEE
16 years 14 days ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
AAAI
2007
15 years 8 months ago
Parallel Structured Duplicate Detection
We describe a novel approach to parallelizing graph search using structured duplicate detection. Structured duplicate detection was originally developed as an approach to external...
Rong Zhou, Eric A. Hansen
ACL
1998
15 years 7 months ago
Time Mapping with Hypergraphs
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
Jan W. Amtrup, Volker Weber
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
15 years 1 months ago
Effect of network structure on the stability margin of large vehicle formation with distributed control
We study the problem of distributed control of a large network of double-integrator agents to maintain a rigid formation. A few lead vehicles are given information on the desired t...
He Hao, Prabir Barooah, J. J. P. Veerman