Sciweavers

1064 search results - page 62 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
ICPR
2000
IEEE
15 years 8 months ago
Scaling-Up Support Vector Machines Using Boosting Algorithm
In the recent years support vector machines (SVMs) have been successfully applied to solve a large number of classification problems. Training an SVM, usually posed as a quadrati...
Dmitry Pavlov, Jianchang Mao, Byron Dom
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
15 years 7 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu
EVOW
2004
Springer
15 years 9 months ago
Analysis of Proteomic Pattern Data for Cancer Detection
Abstract. In this paper we analyze two proteomic pattern datasets containing measurements from ovarian and prostate cancer samples. In particular, a linear and a quadratic support ...
Kees Jong, Elena Marchiori, Aad van der Vaart
HICSS
2002
IEEE
89views Biometrics» more  HICSS 2002»
15 years 9 months ago
Nash Strategies for Load Serving Entities in Dynamic Energy Multi-markets
In this paper the problem of developing bidding strategies for the participants of dynamic energy-multi markets is studied. Attention is given to strategic bidding of load serving...
Jose B. Cruz Jr., Ashkan Kian
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
15 years 5 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...