Sciweavers

2430 search results - page 335 / 486
» Computing Tutte Polynomials
Sort
View
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
15 years 9 months ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel
119
Voted
IEEESCC
2005
IEEE
15 years 9 months ago
Online and Minimum-Cost Ad Hoc Delegation in e-Service Composition
The paradigm of automated e-service composition through the integration of existing services promises a fast and efficient development of new services in cooperative business env...
Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikum...
104
Voted
LICS
2005
IEEE
15 years 9 months ago
Inverse and Implicit Functions in Domain Theory
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...
Abbas Edalat, Dirk Pattinson
121
Voted
CRYPTO
2005
Springer
96views Cryptology» more  CRYPTO 2005»
15 years 9 months ago
Privacy-Preserving Set Operations
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private i...
Lea Kissner, Dawn Xiaodong Song
162
Voted
FSTTCS
2005
Springer
15 years 9 months ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann