Sciweavers

598 search results - page 57 / 120
» The Puzzle Layout Problem
Sort
View
SIGGRAPH
1995
ACM
13 years 11 months ago
Interactive physically-based manipulation of discrete/continuous models
Physically-based modeling has been used in the past to support a variety of interactive modeling tasks including free-form surface design, mechanism design, constrained drawing, a...
Mikako Harada, Andrew P. Witkin, David Baraff
DAC
2004
ACM
14 years 1 months ago
Optical proximity correction (OPC): friendly maze routing
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
Li-Da Huang, Martin D. F. Wong
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar
UIST
2000
ACM
14 years 4 min ago
Cross-modal interaction using XWeb
The XWeb project addresses the problem of interacting with services by means of a variety of interactive platforms. Interactive clients are provided on a variety of hardware/softw...
Dan R. Olsen, Sean Jefferies, S. Travis Nielsen, W...
JPDC
2006
134views more  JPDC 2006»
13 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong