614 search results - page 58 / 123 » Structuring Knowledge for Reference Generation: A Clustering... |
111
Voted
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. Learning ML...
119
Voted
WWW
2010
ACM
15 years 9 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
116
Voted
ICDM
2009
IEEE
15 years 9 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
115
click to vote
ASPDAC
1995
ACM
15 years 6 months ago
1995
ACM
- In this paper, we present a new scheduling algorithms that generates area-efficient register transfer level datapaths with multiport memories. The proposed scheduling algorithm a...
120
Voted
ICAPR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the seq...