Sciweavers

206 search results - page 33 / 42
» A branch-and-bound algorithm for hard multiple knapsack prob...
Sort
View
AAAI
2006
14 years 11 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
EDBT
2008
ACM
161views Database» more  EDBT 2008»
15 years 9 months ago
Load distribution of analytical query workloads for database cluster architectures
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
Thomas Phan, Wen-Syan Li
P2P
2007
IEEE
113views Communications» more  P2P 2007»
15 years 3 months ago
Handling Network Partitions and Mergers in Structured Overlay Networks
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...
Tallat M. Shafaat, Ali Ghodsi, Seif Haridi
SIGIR
2006
ACM
15 years 3 months ago
Large scale semi-supervised linear SVMs
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...
Vikas Sindhwani, S. Sathiya Keerthi
SIGIR
2011
ACM
14 years 12 days ago
Learning online discussion structures by conditional random fields
Online forum discussions are emerging as valuable information repository, where knowledge is accumulated by the interaction among users, leading to multiple threads with structure...
Hongning Wang, Chi Wang, ChengXiang Zhai, Jiawei H...