Sciweavers

4066 search results - page 88 / 814
» Almost Complete Sets
Sort
View
ICDT
2007
ACM
74views Database» more  ICDT 2007»
14 years 1 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
LREC
2008
103views Education» more  LREC 2008»
13 years 11 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»
13 years 10 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»
13 years 10 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
DCG
1998
80views more  DCG 1998»
13 years 9 months ago
Fitting a Set of Points by a Circle
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink