Sciweavers

261 search results - page 19 / 53
» Complex SLI arithmetic: Representation, algorithms and analy...
Sort
View
KBSE
2006
IEEE
14 years 1 months ago
Modularity Analysis of Logical Design Models
Traditional design representations are inadequate for generalized reasoning about modularity in design and its technical and economic implications. We have developed an architectu...
Yuanfang Cai, Kevin J. Sullivan
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 11 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
SMA
2003
ACM
154views Solid Modeling» more  SMA 2003»
14 years 1 months ago
Discretization of functionally based heterogeneous objects
The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for exampl...
Elena Kartasheva, Valery Adzhiev, Alexander A. Pas...
IJCV
2000
93views more  IJCV 2000»
13 years 7 months ago
How Optimal Depth Cue Integration Depends on the Task
Bayesian parameter estimation can be used to generate statistically optimal solutions to the problem of cue integration. However, the complexity and dimensionality of these solutio...
Paul R. Schrater, Daniel Kersten
ICALP
2004
Springer
14 years 1 months ago
A Domain Theoretic Account of Picard's Theorem
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
Abbas Edalat, Dirk Pattinson