25195 search results - page 4820 / 5039 » Applications of Computers to Dance |
207
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
197
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
179
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
150
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
The WHO Collaborating Centre for International Drug Monitoring in Uppsala, Sweden, maintains and analyses the world's largest database of reports on suspected adverse drug re...
179
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Discriminative sequential learning models like Conditional Random Fields (CRFs) have achieved significant success in several areas such as natural language processing, information...