Sciweavers

7197 search results - page 1219 / 1440
» On the computational power of BlenX
Sort
View
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
13 years 9 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
SDM
2012
SIAM
278views Data Mining» more  SDM 2012»
13 years 9 months ago
Legislative Prediction via Random Walks over a Heterogeneous Graph
In this article, we propose a random walk-based model to predict legislators’ votes on a set of bills. In particular, we first convert roll call data, i.e. the recorded votes a...
Jun Wang, Kush R. Varshney, Aleksandra Mojsilovic
AAAI
2012
13 years 9 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
BMCBI
2005
130views more  BMCBI 2005»
15 years 6 months ago
Squid - a simple bioinformatics grid
Background: BLAST is a widely used genetic research tool for analysis of similarity between nucleotide and protein sequences. This paper presents a software application entitled &...
Paulo C. Carvalho, Rafael V. Glória, Antoni...
HIPC
2000
Springer
15 years 10 months ago
A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks
In this paper, we propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due...
Mainak Chatterjee, Sajal K. Das, Damla Turgut
« Prev « First page 1219 / 1440 Last » Next »