2373 search results - page 111 / 475 » Complexities for generalized models of self-assembly |
172
click to vote
IACR
2011
14 years 4 months ago
2011
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
152
Voted
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
135
click to vote
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
For the tasks of classification, two types of patterns can generate problems: ambiguous patterns and outliers. Furthermore, it is possible to separate classification algorithms in...
139
Voted
ISNN
2007
Springer
15 years 10 months ago
2007
Springer
Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires hu...
133
click to vote
VISUALIZATION
2003
IEEE
15 years 9 months ago
2003
IEEE
Volume rendering and isosurface extraction from three-dimensional scalar fields are mostly based on piecewise trilinear representations. In regions of high geometric complexity s...