Sciweavers

4074 search results - page 221 / 815
» Defining Computational Aesthetics
Sort
View
52
Voted
DAC
2004
ACM
16 years 1 months ago
A general decomposition strategy for verifying register renaming
This paper describes a strategy for verifying data-hazard correctness of out-of-order processors that implement register-renaming. We define a set of predicates to characterize re...
Hazem I. Shehata, Mark Aagaard
102
Voted
DAC
2006
ACM
16 years 1 months ago
Synthesis of synchronous elastic architectures
A simple protocol for latency-insensitive design is presented. The main features of the protocol are the efficient implementation of elastic communication channels and the automat...
Jordi Cortadella, Michael Kishinevsky, Bill Grundm...
123
Voted
ICML
2007
IEEE
16 years 1 months ago
Fast and effective kernels for relational learning from texts
In this paper, we define a family of syntactic kernels for automatic relational learning from pairs of natural language sentences. We provide an efficient computation of such mode...
Alessandro Moschitti, Fabio Massimo Zanzotto
89
Voted
ICML
2005
IEEE
16 years 1 months ago
Experimental comparison between bagging and Monte Carlo ensemble classification
Properties of ensemble classification can be studied using the framework of Monte Carlo stochastic algorithms. Within this framework it is also possible to define a new ensemble c...
Roberto Esposito, Lorenza Saitta
WWW
2006
ACM
16 years 1 months ago
Using semantic rules to determine access control for web services
Semantic Web technologies are bring increasingly employed to solve knowledge management issues in traditional Web technologies. This paper follows that trend and proposes using Se...
Brian Shields, Owen Molloy, Gerard Lyons, Jim Dugg...