Sciweavers

518 search results - page 39 / 104
» Beating a Random Assignment
Sort
View
143
Voted
ML
2007
ACM
156views Machine Learning» more  ML 2007»
15 years 2 months ago
Active learning for logistic regression: an evaluation
Which active learning methods can we expect to yield good performance in learning binary and multi-category logistic regression classifiers? Addressing this question is a natural ...
Andrew I. Schein, Lyle H. Ungar
COCOON
2005
Springer
15 years 4 months ago
On-Line Algorithms for Market Equilibria
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
Spyros Angelopoulos, Atish Das Sarma, Avner Magen,...
90
Voted
IADIS
2003
15 years 3 months ago
Optimizing Web Server's Data Transfer with Hotlinks
We study the optimization of the expected number of bytes that must be transferred by the Web server when a user visits one of its pages. Given a Web site, we want to find an assi...
Evangelos Kranakis, Danny Krizanc, Miguel Vargas M...
IM
2008
15 years 2 months ago
The Structure of Geographical Threshold Graphs
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 2 months ago
Path-independent load balancing with unreliable machines
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
James Aspnes, Yang Richard Yang, Yitong Yin