Sciweavers

1702 search results - page 183 / 341
» Using Nondeterminism to Design Efficient Deterministic Algor...
Sort
View
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 10 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 11 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
WCNC
2008
IEEE
14 years 5 months ago
Estimation of Link Quality and Residual Time in Vehicular Ad Hoc Networks
—High node mobility and transient connectivity in Vehicular Ad Hoc NETworks have introduced numerous challenges in the design of efficient communication protocols for these netwo...
Nikoletta Sofra, Kin K. Leung
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
13 years 10 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen
PDCN
2004
14 years 3 days ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...