Sciweavers

13621 search results - page 311 / 2725
» Computability and Complexity in Self-assembly
Sort
View
207
Voted
SSDBM
2009
IEEE
174views Database» more  SSDBM 2009»
16 years 1 months ago
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
Ruslan Fomkin, Tore Risch
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
16 years 1 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
ICASSP
2008
IEEE
16 years 1 months ago
Stability analysis of complex maximum likelihood ica using Wirtinger calculus
The desirable asymptotic optimality properties of the maximum likelihood (ML) estimator make it an attractive solution for performing independent component analysis (ICA) as well....
Hualiang Li, Tülay Adali
POLICY
2007
Springer
16 years 25 days ago
Using SAML and XACML for Complex Resource Provisioning in Grid Based Applications
This paper presents ongoing research and current results on the development of flexible access control infrastructure for complex resource provisioning (CRP) in Grid-based applica...
Yuri Demchenko, Leon Gommans, Cees de Laat
AICT
2005
IEEE
194views Communications» more  AICT 2005»
16 years 10 days ago
Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
Claus Bauer