1696 search results - page 85 / 340 » Permuted function matching |
ESOP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
SEMCO
2007
IEEE
15 years 4 months ago
2007
IEEE
One of the key objectives of web service technology is to construct processes that enable service providers to inter-connect with their clients. The industry has developed the UDD...
WABI
2001
Springer
15 years 2 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
76
Voted
ICML
2008
IEEE
15 years 11 months ago
2008
IEEE
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...