Sciweavers

4542 search results - page 589 / 909
» Design patterns for data structures
Sort
View
ICALP
2010
Springer
15 years 10 months ago
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
Loukas Georgiadis
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 6 months ago
Spreadsheet Refactoring
Refactoring is a change made to the internal structure of software to make it easier to understand and cheaper to modify without changing its observable behaviour. A database refa...
Patrick O'Beirne
ACL
2010
15 years 4 months ago
The S-Space Package: An Open Source Package for Word Space Models
We present the S-Space Package, an open source framework for developing and evaluating word space algorithms. The package implements well-known word space algorithms, such as LSA,...
David Jurgens, Keith Stevens
HYBRID
2005
Springer
16 years 5 days ago
Mode-Automata Based Methodology for Scade
In this paper, we present a new design methodology for synchronous reactive systems, based on a clear separation between control and data flow parts. This methodology allows to fa...
Ouassila Labbani, Jean-Luc Dekeyser, Pierre Boulet
CATA
2001
15 years 8 months ago
Object-oriented image database model
: In this paper we analyze some existing tools and approaches to image data modeling and we propose an Object-Oriented Image Data (OOID) model. It can be applied on a wide variety ...
William I. Grosky, Peter L. Stanchev