210 search results - page 22 / 42 » Uniform regular enumerations |
DOCENG
2004
ACM
14 years 1 months ago
2004
ACM
A measure of aesthetics that has been used in automated layout is described. The approach combines heuristic measures of attributes that degrade the aesthetic quality. The combina...
ENTCS
2006
13 years 9 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
ADCM
2008
13 years 10 months ago
2008
Learning function relations or understanding structures of data lying in manifolds embedded in huge dimensional Euclidean spaces is an important topic in learning theory. In this ...
PODC
2009
ACM
14 years 10 months ago
2009
ACM
Due to their simplicity and effectiveness, gossip-based membership protocols have become the method of choice for maintaining partial membership in large P2P systems. A variety of...
CIE
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...