Sciweavers

3068 search results - page 351 / 614
» Clustering with Multiple Graphs
Sort
View
TOG
2002
133views more  TOG 2002»
15 years 6 months ago
Interactive motion generation from examples
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
Okan Arikan, David A. Forsyth
INFOCOM
2011
IEEE
14 years 10 months ago
SigSag: Iterative detection through soft message-passing
—The multiple-access framework of ZigZag decoding [1] is a useful technique for combating interference via multiple repeated transmissions, and is known to be compatible with dis...
Arash Saber Tehrani, Alexandros G. Dimakis, Michae...
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 10 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
BMCBI
2005
95views more  BMCBI 2005»
15 years 6 months ago
Oligomeric protein structure networks: insights into protein-protein interactions
Background: Protein-protein association is essential for a variety of cellular processes and hence a large number of investigations are being carried out to understand the princip...
K. V. Brinda, Saraswathi Vishveshwara
WWW
2011
ACM
15 years 1 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii