Sciweavers

4131 search results - page 308 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
135
Voted
MOR
2006
81views more  MOR 2006»
15 years 4 months ago
Simulated Annealing for Convex Optimization
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
Adam Tauman Kalai, Santosh Vempala
WWW
2008
ACM
16 years 5 months ago
Larger is better: seed selection in link-based anti-spamming algorithms
Seed selection is of significant importance for the biased PageRank algorithms such as TrustRank to combat link spamming. Previous work usually uses a small seed set, which has a ...
Qiancheng Jiang, Lei Zhang, Yizhen Zhu, Yan Zhang
ISCA
2008
IEEE
205views Hardware» more  ISCA 2008»
15 years 11 months ago
VEAL: Virtualized Execution Accelerator for Loops
Performance improvement solely through transistor scaling is becoming more and more difficult, thus it is increasingly common to see domain specific accelerators used in conjunc...
Nathan Clark, Amir Hormati, Scott A. Mahlke
GECCO
2009
Springer
188views Optimization» more  GECCO 2009»
15 years 8 months ago
Exploiting multiple classifier types with active learning
Many approaches to active learning involve training one classifier by periodically choosing new data points about which the classifier has the least confidence, but designing a co...
Zhenyu Lu, Josh Bongard
STRINGOLOGY
2004
15 years 6 months ago
Sorting suffixes of two-pattern strings
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
Frantisek Franek, William F. Smyth