Sciweavers

3378 search results - page 587 / 676
» A universe of binding and computation
Sort
View
GD
2005
Springer
15 years 3 months ago
Graph Treewidth and Geometric Thickness Parameters
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
Vida Dujmovic, David R. Wood
ICCS
2005
Springer
15 years 3 months ago
High-Fidelity Simulation of Large-Scale Structures
Active structures capable of responding to external stimulii represent the emerging frontier in structural design. Robust and real-time sensing, control, and actuation pose fundame...
Christoph Hoffmann, Ahmed H. Sameh, Ananth Grama
FPGA
2004
ACM
137views FPGA» more  FPGA 2004»
15 years 3 months ago
Multi-resource aware partitioning algorithms for FPGAs with heterogeneous resources
As FPGA densities increase, partitioning-based FPGA placement approaches are becoming increasingly important as they can be used to provide high-quality and computationally scalab...
Navaratnasothie Selvakkumaran, Abhishek Ranjan, Sa...
ICWL
2004
Springer
15 years 3 months ago
Learning Algorithms with an Electronic Chalkboard over the Web
This paper describes a system for the animation of algorithms on an electronic chalkboard. The instructor teaching an algorithm can enter data directly through a drawing- the algor...
Margarita Esponda Argüero, Raúl Rojas
COMPGEOM
2003
ACM
15 years 3 months ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson