4767 search results - page 194 / 954 » Structures for Abstract Rewriting |
297
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
165
click to vote
ACCV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The detection of motion boundaries has been and remains a longstanding challenge in computer vision. In this paper, the recovery of motion boundaries is recast in a broad...
169
click to vote
CIE
2009
Springer
16 years 1 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...
182
click to vote
FOSSACS
2010
Springer
16 years 29 days ago
2010
Springer
Abstract. We study the semantic meaning of block structure using game semantics and introduce the notion of block-innocent strategies, which turns out to characterise call-by-value...
153
click to vote
INFOCOM
2008
IEEE
16 years 26 days ago
2008
IEEE
Abstract—In order to improve scalability and reduce maintenance overhead for structured Peer-to-Peer systems, researchers design optimal architectures with constant degree and lo...