Sciweavers

16430 search results - page 2646 / 3286
» On Computable Tree Functions
Sort
View
220
Voted
CCS
2006
ACM
15 years 11 months ago
Can machine learning be secure?
Machine learning systems offer unparalled flexibility in dealing with evolving input in a variety of applications, such as intrusion detection systems and spam e-mail filtering. H...
Marco Barreno, Blaine Nelson, Russell Sears, Antho...
CIE
2006
Springer
15 years 11 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
COMPLIFE
2006
Springer
15 years 11 months ago
Relational Subgroup Discovery for Descriptive Analysis of Microarray Data
Abstract. This paper presents a method that uses gene ontologies, together with the paradigm of relational subgroup discovery, to help find description of groups of genes different...
Igor Trajkovski, Filip Zelezný, Jakub Tolar...
CONCUR
2006
Springer
15 years 11 months ago
Some Remarks on Definability of Process Graphs
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
CP
2006
Springer
15 years 11 months ago
Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph charac...
Michele Lombardi, Michela Milano
« Prev « First page 2646 / 3286 Last » Next »