Sciweavers

2542 search results - page 212 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
122
Voted
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 6 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
194
Voted
ICCABS
2011
14 years 4 months ago
Towards accelerating molecular modeling via multi-scale approximation on a GPU
—Research efforts to analyze biomolecular properties contribute towards our understanding of biomolecular function. Calculating non-bonded forces (or in our case, electrostatic s...
Mayank Daga, Wu-chun Feng, Thomas Scogland
76
Voted
CVPR
2010
IEEE
15 years 27 days ago
Exploiting Monge structures in optimum subwindow search
Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a fou...
Senjian An, Patrick Peursum, Wanquan Liu, Svetha V...
105
Voted
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
15 years 6 months ago
ICSPEA: evolutionary five-axis milling path optimisation
ICSPEA is a novel multi-objective evolutionary algorithm which integrates aspects from the powerful variation operators of the Covariance Matrix Adaptation Evolution Strategy (CMA...
Jörn Mehnen, Rajkumar Roy, Petra Kersting, To...
89
Voted
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
15 years 9 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner