1326 search results - page 237 / 266 » Approximate Tree Kernels |
113
click to vote
IJCNN
2007
IEEE
15 years 8 months ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
108
click to vote
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
125
click to vote
ICESS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We propose a novel route optimization protocol for intraNEMO communication using a hierarchical and distributed caching scheme. The proposed scheme employs the routing ca...
104
click to vote
SEMWEB
2007
Springer
15 years 8 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
118
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...