Sciweavers

413 search results - page 66 / 83
» Lattice Boltzmann Method
Sort
View
COCOON
1999
Springer
14 years 23 days ago
On Routing in Circulant Graphs
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...
3DPVT
2006
IEEE
158views Visualization» more  3DPVT 2006»
14 years 6 days ago
Revealing Significant Medial Structure in Polyhedral Meshes
Medial surfaces are popular representations of 3D objects in vision, graphics and geometric modeling. They capture relevant symmetries and part hierarchies and also allow for deta...
Svetlana Stolpner, Kaleem Siddiqi
CAV
2006
Springer
133views Hardware» more  CAV 2006»
14 years 6 days ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...
CLA
2004
13 years 10 months ago
Binary Factor Analysis with Help of Formal Concepts
Binary factor analysis (BFA, also known as Boolean Factor Analysis) is a nonhierarchical analysis of binary data, based on reduction of binary space dimension. It allows us to find...
Ales Keprt, Václav Snásel
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 8 months ago
Directed animals in the gas
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert