Sciweavers

895 search results - page 38 / 179
» Using graphs for some discrete tomography problems
Sort
View
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
14 years 2 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals
GD
1998
Springer
14 years 3 months ago
Using Graph Layout to Visualize Train Interconnection Data
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
Ulrik Brandes, Dorothea Wagner
CGF
2006
128views more  CGF 2006»
13 years 11 months ago
Computing discrete shape operators on general meshes
Discrete curvature and shape operators, which capture complete information about directional curvatures at a point, are essential in a variety of applications: simulation of defor...
Eitan Grinspun, Yotam I. Gingold, Jason Reisman, D...
ATAL
2005
Springer
14 years 4 months ago
Efficient information retrieval using mobile agents
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
Irene Sygkouna, Miltiades E. Anagnostou
COCOA
2007
Springer
14 years 5 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle