Sciweavers

68 search results - page 6 / 14
» A new formulation of the Principle of Indifference
Sort
View
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
15 years 9 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
ACSD
2006
IEEE
102views Hardware» more  ACSD 2006»
14 years 11 months ago
Models of Computation for Networks on Chip
Networks on chip platforms offer the opportunity to introduce a new abstraction level that defines a set of platform services with performance and power characteristics. By making...
Axel Jantsch
POPL
2010
ACM
15 years 7 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
83
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Discriminative Training for direct minimization of deletion, insertion and substitution errors
In this paper, we follow the minimum error principle for acoustic modeling and formulate error objectives in insertion, deletion, and substitution separately for minimization duri...
Sunghwan Shin, Ho-Young Jung, Biing-Hwang Juang
CORR
2008
Springer
101views Education» more  CORR 2008»
14 years 9 months ago
An Approach to Programming Based on Concepts
In this paper we describe a new approach to programming which generalizes object-oriented programming. It is based on using a new programming construct, called concept, which gener...
Alexandr A. Savinov