9871 search results - page 277 / 1975 » On the Structure of Low Sets |
176
click to vote
PODS
1997
ACM
15 years 10 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
167
click to vote
AUSAI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Graph-based representations have been used with considercess in computer vision in the abstraction and recognition of object shape and scene structure. Despite this, the ...
165
click to vote
DM
2006
15 years 6 months ago
2006
Pattern Sturmian words introduced by Kamae and Zamboni KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two k...
159
click to vote
TOIS
2002
15 years 6 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
209
click to vote
SIAMCOMP
2012
13 years 9 months ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...