Sciweavers

849 search results - page 51 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
EUROCRYPT
2007
Springer
13 years 11 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
TSMC
2008
147views more  TSMC 2008»
13 years 7 months ago
A New Approach for Solving Nonlinear Equations Systems
This paper proposes a new perspective for solving systems of complex nonlinear equations by simply viewing them as a multiobjective optimization problem. Every equation in the syst...
Crina Grosan, Ajith Abraham
UC
2005
Springer
14 years 1 months ago
A Computational Model for Self-assembling Flexible Tiles
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
Natasa Jonoska, Gregory L. McColm
ESANN
2007
13 years 9 months ago
Adaptive Global Metamodeling with Neural Networks
Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...
Dirk Gorissen, Wouter Hendrickx, Tom Dhaene
BCB
2010
161views Bioinformatics» more  BCB 2010»
13 years 2 months ago
Genome-wide compatible SNP intervals and their properties
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...
Jeremy W. Wang, Kyle J. Moore, Qi Zhang, Fernando ...