Sciweavers

4934 search results - page 379 / 987
» complexity 2008
Sort
View
CPC
2000
93views more  CPC 2000»
15 years 6 months ago
Fast Unimodular Counting
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
John Mount
DCG
2000
90views more  DCG 2000»
15 years 6 months ago
On the Cocircuit Graph of an Oriented Matroid
In this paper we consider the cocircuit graph GM of an oriented matroid M, the 1-skeleton of the cell complex W formed by the span of the cocircuits of M. In general, W is not dete...
Raul Cordovil, Komei Fukuda, António Guedes...
DEDS
2002
97views more  DEDS 2002»
15 years 6 months ago
N-dimensional Cell-DEVS Models
This article presents an extension to the timed binary Cell-DEVS paradigm. The goal is to allow the modelling of n-dimensional generic cell spaces, including transport or inertial...
Gabriel A. Wainer, Norbert Giambiasi
CGF
1998
142views more  CGF 1998»
15 years 6 months ago
Tree Visualisation and Navigation Clues for Information Visualisation
Information visualisation often requires good navigation aids on large trees, which represent the underlying information. Using trees for information visualisation requires novel ...
Ivan Herman, Maylis Delest, Guy Melançon
DB
1998
119views more  DB 1998»
15 years 6 months ago
SimDS: A Simulation Environment for the Design of Distributed Database Systems
Design of a distributed transaction processing system is a complex process. The paper describes the design and implementation of a general purpose scalable simulation environment ...
Alok R. Chaturvedi, Samir Gupta, Subhajyoti Bandyo...