8810 search results - page 1529 / 1762 » Openness |
181
click to vote
SOFSEM
2007
Springer
16 years 20 days ago
2007
Springer
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
174
click to vote
TCC
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
165
click to vote
TLCA
2007
Springer
16 years 20 days ago
2007
Springer
In our previous work [17] we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This ac...
146
click to vote
APSEC
2006
IEEE
16 years 19 days ago
2006
IEEE
We hypothesize that certain program complexities and difficulties to realize reuse potentials have their roots in weak mechanisms for generic design of today’s programming techn...
161
click to vote
DSRT
2006
IEEE
16 years 19 days ago
2006
IEEE
In MANETs, majority of performance studies are carried out via simulations, where node mobility and radio propagation models play a crucial role. However, popular simulation tools...