3413 search results - page 490 / 683 » New Support Vector Algorithms |
123
click to vote
CIAC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
202
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
128
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: Periodogram analysis of time-series is widespread in biology. A new challenge for analyzing the microarray time series data is to identify genes that are periodically ...
128
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
167
Voted
COMPGEOM
1992
ACM
15 years 7 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...