2440 search results - page 312 / 488 » Data-Intensive Question Answering |
159
click to vote
CISS
2008
IEEE
2008
IEEE
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
16 years 22 days ago
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...
168
click to vote
ESA
2007
Springer
16 years 13 days ago
2007
Springer
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
184
click to vote
EMSOFT
2003
Springer
15 years 11 months ago
2003
Springer
We present a formalism for specifying component interfaces that expose component requirements on limited resources. The formalism permits an algorithmic check if two or more compon...
156
click to vote
HICSS
2002
IEEE
15 years 11 months ago
2002
IEEE
We propose a web-based computer-assisted tool for diagnosing progress in international negotiation. The system is based on a general linear model. Innovative features of the progr...
165
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...