Sciweavers

1029 search results - page 131 / 206
» Compact representations of ordered sets
Sort
View
LREC
2008
168views Education» more  LREC 2008»
13 years 11 months ago
The Annotation Guidelines of the Latin Dependency Treebank and Index Thomisticus Treebank: the Treatment of some specific Syntac
The paper describes the treatment of some specific syntactic constructions in two treebanks of Latin according to a common set of annotation guidelines. Both projects work within ...
David Bamman, Marco Passarotti, Roberto Busa, Greg...
ICASSP
2011
IEEE
13 years 1 months ago
Optimal structure of memory models for lossless compression of binary image contours
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
Ioan Tabus, Septimia Sarbu
WILF
2005
Springer
96views Fuzzy Logic» more  WILF 2005»
14 years 3 months ago
Imprecise Temporal Interval Relations
Abstract. When the time span of an event is imprecise, it can be represented by a fuzzy set, called a fuzzy time interval. In this paper we propose a representation for 13 relation...
Steven Schockaert, Martine De Cock, Etienne E. Ker...
ACSC
2002
IEEE
14 years 3 months ago
Alias Analysis for Exceptions in Java
We propose a flow-sensitive alias analysis algorithm that computes safe and efficient alias sets in Java. For that, we propose a references-set representation of aliased elements,...
Jehak Woo, Jongwook Woo, Isabelle Attali, Denis Ca...
STOC
1987
ACM
82views Algorithms» more  STOC 1987»
14 years 1 months ago
Permutation Groups in NC
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
László Babai, Eugene M. Luks, &Aacut...