4212 search results - page 669 / 843 » On Compressible Pairings and Their Computation |
195
click to vote
GG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...
178
click to vote
ISPDC
2010
IEEE
15 years 5 months ago
2010
IEEE
—In this paper, we propose SKAIT, a parameterized symmetric key pre-distribution scheme that guarantees a secure and confidential channel between every pair of nodes in a wirele...
182
click to vote
ISVC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper, we present a novel graph, sub-graph and supergraph based face representation which captures the facial shape changes and deformations caused due to pose ch...
196
click to vote
JMLR
2010
15 years 5 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
165
click to vote
TCS
2010
15 years 5 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...