1039 search results - page 159 / 208 » Kernels and Regularization on Graphs |
ESA
2006
Springer
15 years 3 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
ICTAI
2002
IEEE
15 years 4 months ago
2002
IEEE
(Appears as a regular paper in the Proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Washington D.C, IEEE Computer Society, Nov. 2002, p...
111
click to vote
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
138
click to vote
TKDE
2011
14 years 6 months ago
2011
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
111
click to vote
HPCN
1997
Springer
15 years 4 months ago
1997
Springer
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...