Sciweavers

1029 search results - page 32 / 206
» Compact representations of ordered sets
Sort
View
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
15 years 4 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
125
Voted
ICIP
2005
IEEE
16 years 4 months ago
Time-evolving 3D model representation for scalable video coding
This paper presents an efficient and scalable coding scheme for transmitting a stream of 3D models extracted from a video of a static scene. As in classical model-based video codi...
Luce Morin, Patrick Gioia, Raphaèle Balter
WEBI
2005
Springer
15 years 8 months ago
Efficient Extraction of Closed Motivic Patterns in Multi-Dimensional Symbolic Representations of Music
In this paper, we present an efficient model for discovering repeated patterns in symbolic representations of music. Combinatorial redundancy inherent to the pattern discovery pa...
Olivier Lartillot
140
Voted
PUK
2000
15 years 3 months ago
On the Instantiation of ADL Operators Involving Arbitrary First-Order Formulas
The generation of the set of all ground actions for a given set of ADL operators, which are allowed to have conditional effects and preconditions that can be represented using arbi...
Jana Koehler, Jörg Hoffmann
FMCAD
1998
Springer
15 years 6 months ago
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification
We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo's algori...
Sergey Berezin, Armin Biere, Edmund M. Clarke, Yun...