Sciweavers

1523 search results - page 85 / 305
» The Computational Complexity of Linear Optics
Sort
View
COMPGEOM
2008
ACM
13 years 10 months ago
The complexity of the outer face in arrangements of random segments
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sh...
VLSID
2001
IEEE
132views VLSI» more  VLSID 2001»
14 years 9 months ago
Accurate Power Macro-modeling Techniques for Complex RTL Circuits
This paper presents novel techniques for the cycle-accurate power macro-modeling of complex RTL components. The proposed techniques are based on the observation that RTL component...
Nachiketh R. Potlapally, Michael S. Hsiao, Anand R...
CAGD
2010
151views more  CAGD 2010»
13 years 9 months ago
On the complexity of smooth spline surfaces from quad meshes
This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the...
Jörg Peters, Jianhua Fan
ICC
2007
IEEE
142views Communications» more  ICC 2007»
14 years 3 months ago
Reduced-Complexity Cluster Modelling for the 3GPP Channel Model
—The realistic performance of a multi-input multi-output (MIMO) communication system depends strongly on the spatial correlation properties introduced by clustering in the propag...
Hui Xiao, Alister G. Burr, Rodrigo C. de Lamare
PODS
2001
ACM
135views Database» more  PODS 2001»
14 years 9 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...