Sciweavers

4403 search results - page 117 / 881
» Galois Theory of Algorithms
Sort
View
VISUALIZATION
2003
IEEE
15 years 11 months ago
Counting Cases in Marching Cubes: Toward a Generic Algorithm for Producing Substitopes
We describe how to count the cases that arise in a family of visualization techniques, including Marching Cubes, Sweeping Simplices, Contour Meshing, Interval Volumes, and Separat...
David C. Banks, Stephen A. Linton
CLUSTER
2002
IEEE
15 years 11 months ago
Algorithmic Mechanism Design for Load Balancing in Distributed Systems
Computational Grids are large scale computing system composed of geographically distributed resources (computers, storage etc.) owned by self interested agents or organizations. T...
Daniel Grosu, Anthony T. Chronopoulos
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 10 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
DEDS
2008
108views more  DEDS 2008»
15 years 6 months ago
An Algorithmic Toolbox for Network Calculus
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
Anne Bouillard, Eric Thierry
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
16 years 3 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari