Sciweavers

3108 search results - page 296 / 622
» The Elements of Computer Credibility
Sort
View
NIPS
1998
15 years 8 months ago
Learning from Dyadic Data
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
Thomas Hofmann, Jan Puzicha, Michael I. Jordan
ACL
1989
15 years 7 months ago
A Three-Valued Interpretation of Negation in Feature Structure Descriptions
Feature structures are informational elements that have been used in several linguistic theories and in computational systems for natural-language processing. A logicaJ calculus h...
Anuj Dawar, K. Vijay-Shanker
DAC
2009
ACM
15 years 7 months ago
Way Stealing: cache-assisted automatic instruction set extensions
This paper introduces Way Stealing, a simple architectural modification to a cache-based processor to increase data bandwidth to and from application-specific Instruction Set Exte...
Theo Kluter, Philip Brisk, Paolo Ienne, Edoardo Ch...
ICPR
2010
IEEE
15 years 6 months ago
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
Luisa Micó, José Oncina
BIB
2008
74views more  BIB 2008»
15 years 6 months ago
The relative value of operon predictions
For most organisms, computational operon predictions are the only source of genome-wide operon information. Operon prediction methods described in literature are based on (a combi...
Rutger W. W. Brouwer, Oscar P. Kuipers, Sacha A. F...