2638 search results - page 456 / 528 » Random Geometric Complexes |
ALT
1997
Springer
14 years 9 days ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
ANCS
2007
ACM
14 years 4 days ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
ASIACRYPT
2009
Springer
14 years 4 days ago
2009
Springer
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...
CP
2007
Springer
14 years 2 days ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
EUROSYS
2007
ACM
14 years 1 days ago
2007
ACM
As information technology (IT) administration becomes increasingly complex, workflow technologies are gaining popularity for IT automation. Writing correct workflow programs is no...