Sciweavers

1301 search results - page 118 / 261
» Bounded Version Vectors
Sort
View
ISCAS
2006
IEEE
80views Hardware» more  ISCAS 2006»
15 years 11 months ago
Fundamental limitations of continuous-time delta-sigma modulators due to clock jitter
We examine noise due to clock jitter in single-loop low pass continuous-time delta-sigma modulators employing NRZ feedback DACs. Using the discrete-time version of the Bode sensit...
K. Reddy, S. Pavan
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
15 years 10 months ago
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
Aleksander Madry
AIPS
2009
15 years 6 months ago
SAT-Based Parallel Planning Using a Split Representation of Actions
Planning based on propositional SAT(isfiability) is a powerful approach to computing step-optimal plans given a parallel execution semantics. In this setting: (i) a solution plan ...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
AUTOMATICA
2007
68views more  AUTOMATICA 2007»
15 years 5 months ago
Frequency domain maximum likelihood estimation of linear dynamic errors-in-variables models
- This paper studies the linear dynamic errors-in-variables problem in the frequency domain. First the identifiability is shown under relaxed conditions. Next a frequency domain Ga...
Rik Pintelon, Johan Schoukens
CPC
2008
66views more  CPC 2008»
15 years 5 months ago
B2[ g] Sets and a Conjecture of Schinzel and Schmidt
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a + a , with a a and a, a A. We obtain a new lower bound for F(g, n), t...
Javier Cilleruelo, Carlos Vinuesa