Sciweavers

10997 search results - page 134 / 2200
» On the Structure of Complete Sets
Sort
View
FM
1997
Springer
159views Formal Methods» more  FM 1997»
15 years 10 months ago
Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
David Cazier, Jean-François Dufourd
ICDT
2007
ACM
74views Database» more  ICDT 2007»
15 years 10 months ago
World-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
Lyublena Antova, Christoph Koch, Dan Olteanu
142
Voted
LREC
2008
103views Education» more  LREC 2008»
15 years 7 months ago
LIRICS Semantic Role Annotation: Design and Evaluation of a Set of Data Categories
In this paper we report on the analyses of alternative approaches to semantic role annotation (FrameNet (FrameNet, 2005), PropBank (Palmer et al., 2005) and VerbNet (Kipper, 2006)...
Volha Petukhova, Harry Bunt
ARSCOM
2008
85views more  ARSCOM 2008»
15 years 6 months ago
Minimal blocking sets in PG(2, 9)
We classify the minimal blocking sets of size 15 in PG(2, 9). We show that the only examples are the projective triangle and the sporadic example arising from the secants to the u...
Fernanda Pambianco, Leo Storme
CORR
2007
Springer
99views Education» more  CORR 2007»
15 years 6 months ago
Periodic complementary sets of binary sequences
Let PCSN p denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a δ-function. In the 1990, B¨omer and Antweiler addres...
Dragomir Z. Djokovic