Sciweavers

56 search results - page 4 / 12
» How good are interior point methods
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Multiple kernel learning, conic duality, and the SMO algorithm
While classical kernel-based classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. ...
Francis R. Bach, Gert R. G. Lanckriet, Michael I. ...
BMCBI
2010
147views more  BMCBI 2010»
13 years 7 months ago
Automatic detection of anchor points for multiple sequence alignment
Background: Determining beforehand specific positions to align (anchor points) has proved valuable for the accuracy of automated multiple sequence alignment (MSA) software. This f...
Florian Pitschi, Claudine Devauchelle, Eduardo Cor...
SIAMIS
2008
174views more  SIAMIS 2008»
13 years 7 months ago
Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant val...
Mila Nikolova, Michael K. Ng, Shuqin Zhang, Wai-Ki...
ICALP
2003
Springer
14 years 21 days ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
14 years 1 months ago
Similarity Queries in Data Bases Using Metric Distances - from Modeling Semantics to Its Maintenance
Similarity queries in traditional databases work directly on attribute values. But, often similar attribute values do not indicate similar meanings. Semantic background information...
Josef Küng, Roland Wagner