Sciweavers

10899 search results - page 2108 / 2180
» Wide Area Computation
Sort
View
KDD
2012
ACM
197views Data Mining» more  KDD 2012»
13 years 6 months ago
On the separability of structural classes of communities
Three major factors govern the intricacies of community extraction in networks: (1) the application domain includes a wide variety of networks of fundamentally different natures,...
Bruno D. Abrahao, Sucheta Soundarajan, John E. Hop...
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
13 years 6 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 6 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
15 years 10 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...

Publication
124views
17 years 2 months ago
Survivability in IP over WDM networks
The Internet is emerging as the new universal telecommunication medium. IP over WDM has been envisioned as one of the most attractive architectures for the new Internet. Consequent...
Kulathumani Vinodkrishnan, Nikhil Chandhok, Arjan ...
« Prev « First page 2108 / 2180 Last » Next »