WINE
2010
Springer
13 years 2 months ago
2010
Springer
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...
ENDM
2006
13 years 4 months ago
2006
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...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
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 ...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
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...
CRV
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
ICDM
2009
IEEE
13 years 11 months ago
2009
IEEE
—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...
SASP
2009
IEEE
13 years 11 months ago
2009
IEEE
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...
KDD
2008
ACM
14 years 4 months ago
2008
ACM
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 ...