Sciweavers

6045 search results - page 937 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
NETWORKS
2008
15 years 6 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
CAD
2005
Springer
15 years 6 months ago
Modeling generalized cylinders using direction map representation
For generalized cylinders (GC) defined by contours of discrete curves, we propose two algorithms to generate GC surfaces (1) in polygonal meshes and (2) in cylindrical type of dev...
Joo-Haeng Lee
CG
2005
Springer
15 years 6 months ago
An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization
An unstructured tetrahedral mesh generation algorithm for 3D model with constraints is presented. To automatically generate a tetrahedral mesh for model with constraints, an advan...
Yi-Jun Yang, Jun-Hai Yong, Jia-Guang Sun
CG
2004
Springer
15 years 6 months ago
CyberTape: an interactive measurement tool on polyhedral surface
Polyhedral mesh surfaces are widely utilized to represent objects reconstructed from 3D ranged images. In computer-aided engineering, it is desired to not only observe but also me...
Charlie C. L. Wang
VLSISP
2002
112views more  VLSISP 2002»
15 years 6 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai