Sciweavers

5699 search results - page 1048 / 1140
» Alternating model trees
Sort
View
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
16 years 17 days ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
SAC
2006
ACM
16 years 10 days ago
Trust-decisions on the base of maximal information of recommended direct-trust
Nowadays the concept of trust in computer communications starts to get more and more popular. While the idea of trust in human interaction seems to be obvious and understandable i...
Uwe Roth, Volker Fusenig
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
15 years 12 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su
WINE
2005
Springer
100views Economy» more  WINE 2005»
15 years 12 months ago
A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Va...
SIGIR
2004
ACM
15 years 11 months ago
Configurable indexing and ranking for XML information retrieval
Indexing and ranking are two key factors for efficient and effective XML information retrieval. Inappropriate indexing may result in false negatives and false positives, and impro...
Shaorong Liu, Qinghua Zou, Wesley W. Chu
« Prev « First page 1048 / 1140 Last » Next »