Exploració per autor "Gavaldà Mestre, Ricard"
Ara es mostren els items 68-87 de 90
-
Obtaining synchronization-free code with maximum parallelism
(1996-03)
Report de recerca
Accés obertThis paper addresses the problem of extracting the maximum synchronization-free parallelism that may be present in loops. In order to reduce communication and synchronization overheads, some parallelizing compilers ... -
On infinite sequences (almost) as easy as pi
(1994-04)
Report de recerca
Accés obertIt is known that infinite binary sequences of constant Kolmogorov complexity are exactly the recursive ones. Such a kind of statement no longer holds in the presence of resource bounds. Contrary to what intuition might ... -
On the power of equivalence queries
(Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 1993-01-01)
Report de recerca
Accés obertIn 1990, Angluin showed that no class exhibiting a combinatorial property called approximate fingerprints can be identified exactly using polynomially many Equivalence queries. Here we show that this is a necessary condition: ... -
On-line sampling methods for discovering association rules
(1999-02)
Report de recerca
Accés obertAssociation rule discovery is one of the prototypical problems in data mining. In this problem, the input database is assumed to be very large and most of the algorithms are designed to minimize the number of scans of ... -
Oracles and queries that are sufficient for exact learning
(1994-08)
Report de recerca
Accés obertWe show that the class of all circuits is exactly learnable in randomized expected polynomial time using weak subset and weak superset queries. This is a consequence of the following result which we consider to be of ... -
Pipeline design to identify key features and classify the chemotherapy response on lung cancer patients using large-scale genetic data
(2018-11-20)
Article
Accés obertBackground: During the last decade, the interest to apply machine learning algorithms to genomic data has increased in many bioinformatics applications. Analyzing this type of data entails difficulties for managing ... -
Power-aware multi-data center management using machine learning
(2013)
Text en actes de congrés
Accés obertThe cloud relies upon multi-datacenter (multi-DC) infrastructures distributed along the world, where people and enterprises pay for resources to offer their web-services to worldwide clients. Intelligent management is ... -
Practical algorithms for on-line sampling
(1998-06)
Report de recerca
Accés obertOne of the core applications of machine learning to knowledge discovery consists on building a function (a hypothesis) from a given amount of data (for instance a decision tree or a neural network) such that we can use ... -
Predicting web server crashes: a case study in comparing prediction algorithms
(IARIA, 2009)
Text en actes de congrés
Accés obertTraditionally, performance has been the most important metrics when evaluating a system. However, in the last decades industry and academia have been paying increasing attention to another metric to evaluate servers: ... -
Rehabilitation profiles of older adult stroke survivors admitted to intermediate care units: A multi-centre study
(2016-11-09)
Article
Accés obertBackground: Stroke is a major cause of disability in older adults, but the evidence around post-acute treatment is limited and heterogeneous. We aimed to identify profiles of older adult stroke survivors admitted to ... -
Relativized separations of polynomial space and exponential time
(1991-11-19)
Report de recerca
Accés obertWe present several applications of generalized Kolmogorov complexity to the construction of oracles separating complexity classes. We choose as examples of application the classes PSPACE, NPSPACE, and EXPTIME, and present ... -
Resolution of NP-complete problems
(1995-06-03)
Report de recerca
Accés obertThese are the course notes for my lectures on "Resolution of NP-complete problems". These lectures are a part of the Sixth Advanced Course on Artificial Intelligence, ACAI'95, which this year is devoted to AI Algorithmics, ... -
Sequential sampling algorithms: unified analysis and lower bounds
(2001-11)
Report de recerca
Accés obertSequential sampling algorithms have recently attracted interest as a way to design scalable algorithms for Data mining and KDD processes. In this paper, we identify an elementary sequential sampling task (estimation from ... -
Some structural complexity aspects of neural computation
(1992)
Report de recerca
Accés obertRecent work by Siegelmann and Sontag has demonstrated that polynomial time on linear saturated recurrent neural networks equas polynomial time on standard computational models: Turing machines if the weights of the net are ... -
Strong and robustly strong polynomial time reducibilities to sparse sets
(1988)
Report de recerca
Accés obertReducibility defined by oracle strong nondeterministic machines is studied. Two definitions of relativized strength are presented and separated. The corresponding reduction classes of the sparse sets give two nonuniform ... -
Structural analysis of polynomial time query learnability
(1992-03-12)
Report de recerca
Accés obertFor some representation classes, we relate its polynomial time query learnability to the complexity of representation finding problems of P/poly oracles. For example, for CIR, a representation class by logical circuits, ... -
The complexity of learning with queries
(1994-04-14)
Report de recerca
Accés obertWe survey recent research concerning the qualitative complexity of Angluin's model of learning with queries. In this model, there is a learner that tries to identify a target concept by means of queries to a teacher. Thus, ... -
The frequency spectrum of finite samples from the intermittent silence process
(2009-04)
Article
Accés obertIt has been argued that the actual distribution of word frequencies could be reproduced or explained by generating a random sequence of letters and spaces according to the so-called intermittent silence process. The same ... -
Towards energy-aware scheduling in data centers using machine learning
(2010-04-15)
Text en actes de congrés
Accés obertAs energy-related costs have become a major economical factor for IT infrastructures and data-centers, companies and the research community are being challenged to nd better and more efficient power-aware resource ... -
Tractabilitat de NP i altres classes de complexitat per famílies de circuits booleans
(1987-11)
Report de recerca
Accés obertWe search for nonuniform analogs of the complexity class N P ¿ coN P. Following mainly the work of Karp and Lipton on these classes, 1) We define two types of polynomial time reducibility, study some of their basic properties ...
