Sciweavers

316 search results - page 61 / 64
» Network Generalized Hamming Weight
Sort
View
DC
2010
13 years 7 months ago
A knowledge-based analysis of global function computation
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
Joseph Y. Halpern, Sabina Petride
NN
1998
Springer
177views Neural Networks» more  NN 1998»
13 years 6 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 2 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 7 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
MOR
2008
169views more  MOR 2008»
13 years 7 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang