Sciweavers

7228 search results - page 186 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 6 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
121
Voted
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
15 years 10 months ago
Learning building block structure from crossover failure
In the classical binary genetic algorithm, although crossover within a building block (BB) does not always cause a decrease in fitness, any decrease in fitness results from the ...
Zhenhua Li, Erik D. Goodman
SAC
2006
ACM
15 years 3 months ago
Generating correct EPCs from configured C-EPCs
Process reference models play an important role for the alignment and configuration of commercial off-the-shelf Enterprise Systems to requirements of an organization. Recently, Co...
Jan Mendling, Jan Recker, Michael Rosemann, Wil M....
136
Voted
WWW
2008
ACM
15 years 3 months ago
Discovering geographical-specific interests from web click data
As the Internet continues to play an important role in many business applications, it becomes vital to increase the competitive edge by offering geographically tailored contents t...
Chang Sheng, Wynne Hsu, Mong-Li Lee
147
Voted
CGF
2002
187views more  CGF 2002»
15 years 3 months ago
Stylizing Silhouettes at Interactive Rates: From Silhouette Edges to Silhouette Strokes
A way to create effective stylized line drawings is to draw strokes that start and stop at visible portions along the silhouette of an object to be portrayed. In computer graphics...
Tobias Isenberg, Nick Halper, Thomas Strothotte