Sciweavers

1760 search results - page 215 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
IJCAI
1997
13 years 9 months ago
Automatic Generation of Heuristics for Scheduling
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
Robert A. Morris, John L. Bresina, Stuart M. Rodge...
ICML
2006
IEEE
14 years 8 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
DASFAA
2008
IEEE
120views Database» more  DASFAA 2008»
14 years 2 months ago
Knowledge Transferring Via Implicit Link Analysis
In this paper, we design a local classification algorithm using implicit link analysis, considering the situation that the labeled and unlabeled data are drawn from two different ...
Xiao Ling, Wenyuan Dai, Gui-Rong Xue, Yong Yu
IPPS
2006
IEEE
14 years 2 months ago
On collaborative content distribution using multi-message gossip
We study epidemic schemes in the context of collaborative data delivery. In this context, multiple chunks of data reside at different nodes, and the challenge is to simultaneousl...
Yaacov Fernandess, Dahlia Malkhi