1029 search results - page 69 / 206 » Compact representations of ordered sets |
175
click to vote
WCRE
2010
IEEE
15 years 1 months ago
2010
IEEE
—We present a semi-automated approach for the reverse engineering of UML sequence diagrams. Our approach starts with a set of execution traces that are automatically aligned in o...
132
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
117
Voted
CANS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
117
Voted
DEXA
2005
Springer
15 years 8 months ago
2005
Springer
Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extensi...
145
click to vote
FUIN
2007
15 years 3 months ago
2007
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...