1188 search results - page 28 / 238 » Generating Connectives |
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
IMR
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we propose a robust isotropic tetrahedral mesh generation method. An advancing front method is employed to control local mesh density and to easily preserve the ori...
70
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
This paper presents a case study concerning the challenges and requirements posed by next generation language resources, realized as an overall model of open, distributed and coll...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—Recently, there has been great interest in physical layer security techniques that exploit the randomness of wireless channels for securely extracting cryptographic keys. Severa...
COMPSEC
2010
14 years 9 months ago
2010
Many modern mobile devices, such as mobile phones or Personal Digital Assistants (PDAs), are able to run Java applications, such as games, Internet browsers, chat tools and so on....