Sciweavers

1855 search results - page 284 / 371
» System Consequence
Sort
View
SIAMSC
2008
127views more  SIAMSC 2008»
13 years 10 months ago
Fast (Structured) Newton Computations
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
Thomas F. Coleman, Wei Xu
IMCS
2007
78views more  IMCS 2007»
13 years 10 months ago
Usable set-up of runtime security policies
Setting up runtime security policies as required for firewalls or as envisioned by policy languages for the Semantic Web is a difficult task, especially for lay users who have l...
Almut Herzog, Nahid Shahmehri
AUTOMATICA
2005
126views more  AUTOMATICA 2005»
13 years 10 months ago
Relations between uncertainty structures in identification for robust control
Various techniques of system identification exist that provide a nominal model and an uncertainty bound. An important question is what the implications are for the particular choi...
Sippe G. Douma, Paul M. J. Van den Hof
JACM
2007
85views more  JACM 2007»
13 years 10 months ago
The rational numbers as an abstract data type
onal Numbers as an Abstract Data Type1 J A Bergstra2 University of Amsterdam, Informatics Institute, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands J V Tucker3 Department of Com...
Jan A. Bergstra, J. V. Tucker
TIT
2008
102views more  TIT 2008»
13 years 10 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo