Sciweavers

310 search results - page 10 / 62
» Extended grey numbers and their operations
Sort
View
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 4 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro
FOSAD
2009
Springer
14 years 1 months ago
The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
Sebastian Mödersheim, Luca Viganò
AAAI
1997
13 years 8 months ago
Representing Sequences in Description Logics
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
Haym Hirsh, Daniel Kudenko
EOR
2006
75views more  EOR 2006»
13 years 7 months ago
A rolling stock circulation model for combining and splitting of passenger trains
This paper addresses the railway rolling stock circulation problem. Given the departure and arrival times as well as the expected numbers of passengers, we have to assign the roll...
Pieter-Jan Fioole, Leo G. Kroon, Gábor Mar&...
ICDE
2008
IEEE
215views Database» more  ICDE 2008»
14 years 8 months ago
Fast and Simple Relational Processing of Uncertain Data
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical pa...
Lyublena Antova, Thomas Jansen, Christoph Koch, Da...