999 search results - page 65 / 200 » Spectral simplex method |
FOCS
1994
IEEE
15 years 2 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
ICDM
2007
IEEE
15 years 1 months ago
2007
IEEE
Recently the problem of dimensionality reduction (or, subspace learning) has received a lot of interests in many fields of information processing, including data mining, informati...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph ...
106
click to vote
IPCO
1993
14 years 11 months ago
1993
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
FLAIRS
2008
15 years 10 days ago
2008
Spectral Graph Transducer(SGT) is one of the superior graph-based transductive learning methods for classification. As for the Spectral Graph Transducer algorithm, a good graph re...