Sciweavers

6274 search results - page 350 / 1255
» From query complexity to computational complexity
Sort
View
ICC
2009
IEEE
144views Communications» more  ICC 2009»
16 years 1 months ago
Capacity of Optical Intensity Channels with Peak and Average Power Constraints
— The design and analysis of capacity-approaching input signalling for optical intensity channels are presented. Both peak and average optical power constraints are considered in...
Ahmed A. Farid, Steve Hranilovic
GD
2005
Springer
16 years 7 days ago
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
Seok-Hee Hong
IWPEC
2004
Springer
16 years 2 days ago
Packing Edge Disjoint Triangles: A Parameterized View
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
Luke Mathieson, Elena Prieto, Peter Shaw
PPSN
2000
Springer
15 years 10 months ago
Optimization as Side-Effect of Evolving Allelopathic Diversity
Many bacteria carry gene complexes that code for a toxin-antidote pair, e.g. colicin systems. Such gene complexes can be advantageous for its host by killing competitor bacteria wh...
Ludo Pagie, Paulien Hogeweg
RT
1995
Springer
15 years 10 months ago
A Clustering Algorithm for Radiance Calculation in General Environments
: This paper introduces an efficient hierarchical algorithm capable of simulating light transfer for complex scenes containing non-diffuse surfaces. The algorithmstemsfroma newfor...
François X. Sillion, George Drettakis, Cyri...