Sciweavers

27354 search results - page 4959 / 5471
» Distributed And Parallel Computing
Sort
View
ICDE
2012
IEEE
203views Database» more  ICDE 2012»
13 years 9 months ago
Parameter-Free Determination of Distance Thresholds for Metric Distance Constraints
—The importance of introducing distance constraints to data dependencies, such as differential dependencies (DDs) [28], has recently been recognized. The metric distance constrai...
Shaoxu Song, Lei Chen 0002, Hong Cheng
INFOCOM
2012
IEEE
13 years 9 months ago
Fair background data transfers of minimal delay impact
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
Costas Courcoubetis, Antonis Dimakis
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
13 years 9 months ago
Learning from crowds in the presence of schools of thought
Crowdsourcing has recently become popular among machine learning researchers and social scientists as an effective way to collect large-scale experimental data from distributed w...
Yuandong Tian, Jun Zhu
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
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 9 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
« Prev « First page 4959 / 5471 Last » Next »