2479 search results - page 370 / 496 » Random Event Structures |
CRYPTO
2005
Springer
14 years 3 months ago
2005
Springer
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
WEA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
GLVLSI
2003
IEEE
14 years 3 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
SIGGRAPH
2010
ACM
14 years 2 months ago
2010
ACM
In this paper, we introduce a compact random-access vector representation for solid textures made of intermixed regions with relatively smooth internal color variations. It is fea...
IWVF
2001
Springer
14 years 2 months ago
2001
Springer
In the framework of an evolutionary approach to machine learning, this paper presents the preliminary version of a learning system that uses Genetic Programming as a tool for autom...