2100 search results - page 256 / 420 » Learning to rank on graphs |
163
click to vote
ATAL
2003
Springer
15 years 12 months ago
2003
Springer
Agents must decide with whom to interact, which is nontrivial when no central directories are available. A classical decentralized approach is referral systems, where agents adapt...
199
click to vote
DAC
1999
ACM
15 years 11 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
163
click to vote
CPM
2007
Springer
15 years 10 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
179
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
147
click to vote
ACL
2008
15 years 8 months ago
2008
In this paper, we study the problem of summarizing email conversations. We first build a sentence quotation graph that captures the conversation structure among emails. We adopt t...