Sciweavers

2638 search results - page 39 / 528
» Random Geometric Complexes
Sort
View
DPHOTO
2010
195views Hardware» more  DPHOTO 2010»
15 years 3 months ago
Direct PSF estimation using a random noise target
Conventional point spread function (PSF) measurement methods often use parametric models for the estimation of the PSF. This limits the shape of the PSF to a specific form provide...
Johannes Brauers, Claude Seiler, Til Aach
COMPGEOM
2011
ACM
14 years 5 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
ISAAC
2003
Springer
85views Algorithms» more  ISAAC 2003»
15 years 7 months ago
Geometric Restrictions on Producible Polygonal Protein Chains
Fixed-angle polygonal chains in 3D serve as an interesting model of protein backbones. Here we consider such chains produced inside a “machine” modeled crudely as a cone, and e...
Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
INFOCOM
2003
IEEE
15 years 7 months ago
Interaction of TCP Flows as Billiards
Abstract— The aim of this paper is to analyze the performance of a large number of long lived TCP controlled flows sharing many routers (or links), from the knowledge of the net...
François Baccelli, Dohy Hong
ASPDAC
2010
ACM
211views Hardware» more  ASPDAC 2010»
15 years 5 hour ago
A fast analog mismatch analysis by an incremental and stochastic trajectory piecewise linear macromodel
To cope with an increasing complexity when analyzing analog mismatch in sub-90nm designs, this paper presents a fast non-MonteCarlo method to calculate mismatch in time domain. Th...
Hao Yu, Xuexin Liu, Hai Wang, Sheldon X.-D. Tan