Sciweavers

16430 search results - page 378 / 3286
» On Computable Tree Functions
Sort
View
ECCC
2006
96views more  ECCC 2006»
15 years 6 months ago
An Unconditional Study of Computational Zero Knowledge
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
Salil P. Vadhan
ENTCS
2007
153views more  ENTCS 2007»
15 years 6 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
RECOMB
2005
Springer
16 years 6 months ago
Reconstruction of Reticulate Networks from Gene Trees
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
Daniel H. Huson, Tobias H. Klöpper, Pete J. L...
ICML
2009
IEEE
16 years 7 months ago
Route kernels for trees
Almost all tree kernels proposed in the literature match substructures without taking into account their relative positioning with respect to one another. In this paper, we propos...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
ICDIM
2007
IEEE
16 years 17 days ago
Pattern-based decision tree construction
Learning classifiers has been studied extensively the last two decades. Recently, various approaches based on patterns (e.g., association rules) that hold within labeled data hav...
Dominique Gay, Nazha Selmaoui, Jean-Françoi...