243 search results - page 18 / 49 » A Computational Model of Empathy: Empirical Evaluation |
SRDS
1998
IEEE
15 years 3 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
NIPS
1998
15 years 4 days ago
1998
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
104
click to vote
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
KDD
2009
ACM
15 years 11 months ago
2009
ACM
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...