Sciweavers

4342 search results - page 276 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
AAAI
2010
15 years 8 months ago
Smooth Optimization for Effective Multiple Kernel Learning
Multiple Kernel Learning (MKL) can be formulated as a convex-concave minmax optimization problem, whose saddle point corresponds to the optimal solution to MKL. Most MKL methods e...
Zenglin Xu, Rong Jin, Shenghuo Zhu, Michael R. Lyu...
182
Voted
BMCBI
2007
233views more  BMCBI 2007»
15 years 6 months ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
16 years 4 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
ICRA
2007
IEEE
106views Robotics» more  ICRA 2007»
16 years 1 months ago
Exploring Different Coherence Dimensions to Answer Proximity Queries for Convex Polyhedra
— Different coherence dimensions can be considered to improve the performances of an algorithm for computing collision translations of pairs of convex polyhedra. The algorithm’...
Claudio Mirolo, Stefano Carpin, Enrico Pagello
KDD
2009
ACM
140views Data Mining» more  KDD 2009»
16 years 7 months ago
Improving clustering stability with combinatorial MRFs
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...
Ron Bekkerman, Martin Scholz, Krishnamurthy Viswan...