5214 search results - page 196 / 1043 » The Online Specialization Problem |
136
click to vote
IJON
1998
15 years 4 months ago
1998
Paper [1] aimed at providing a unified presentation of neural network architectures. We show in the present comment (i) that the canonical form of recurrent neural networks presen...
179
click to vote
SIGIR
2002
ACM
15 years 3 months ago
2002
ACM
tion Abstract ChengXiang Zhai (Advisor: John Lafferty) Language Technologies Institute School of Computer Science Carnegie Mellon University With the dramatic increase in online in...
164
click to vote
KAIS
2011
14 years 11 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
156
click to vote
JACM
2006
15 years 4 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
135
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
Trust between a pair of users is an important piece of information for users in an online community (such as electronic commerce websites and product review websites) where users ...