Sciweavers

Share
WINE
2010
Springer
220views Economy» more  WINE 2010»
8 years 4 months ago
Threshold Models for Competitive Influence in Social Networks
The problem of influence maximization deals with choosing the optimal set of nodes in a social network so as to maximize the resulting spread of a technology (opinion, productowne...
Allan Borodin, Yuval Filmus, Joel Oren
ENDM
2006
69views more  ENDM 2006»
8 years 6 months ago
Timetabling problems at the TU Eindhoven
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
John van den Broek, Cor A. J. Hurkens, Gerhard J. ...
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
8 years 7 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
GECCO
2007
Springer
143views Optimization» more  GECCO 2007»
9 years 13 days ago
Learning and exploiting knowledge in multi-agent task allocation problems
Imagine a group of cooperating agents attempting to allocate tasks amongst themselves without knowledge of their own capabilities. Over time, they develop a belief of their own sk...
Adam Campbell, Annie S. Wu
CRV
2007
IEEE
116views Robotics» more  CRV 2007»
9 years 18 days ago
A non-myopic approach to visual search
We show how a greedy approach to visual search — i.e., directly moving to the most likely location of the target — can be suboptimal, if the target object is hard to detect. I...
Julia Vogel, Kevin Murphy
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
9 years 28 days ago
Fast Online Training of Ramp Loss Support Vector Machines
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
Zhuang Wang, Slobodan Vucetic
SASP
2009
IEEE
222views Hardware» more  SASP 2009»
9 years 1 months ago
Arithmetic optimization for custom instruction set synthesis
Abstract—One of the ways that custom instruction set extensions can improve over software execution is through the use of hardware structures that have been optimized at the arit...
Ajay K. Verma, Yi Zhu, Philip Brisk, Paolo Ienne
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
9 years 6 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
books