Sciweavers

2450 search results - page 16 / 490
» Time Mapping with Hypergraphs
Sort
View
WABI
2004
Springer
15 years 3 months ago
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
Jens Gramm
IV
2005
IEEE
183views Visualization» more  IV 2005»
15 years 3 months ago
3D Information Visualization for Time Dependent Data on Maps
The visual analysis of time dependent data is an essential task in many application fields. However, visualizing large time dependent data collected within a spatial context is st...
Christian Tominski, Petra Schulze-Wollgast, Heidru...
CGF
2011
14 years 4 months ago
A Survey of Real-Time Hard Shadow Mapping Methods
Due to its versatility, speed and robustness, shadow mapping has always been a popular algorithm for fast hard
Daniel Scherzer, Michael Wimmer, Werner Purgathofe...
83
Voted
TCAD
2010
110views more  TCAD 2010»
14 years 4 months ago
Dose Map and Placement Co-Optimization for Improved Timing Yield and Leakage Power
Abstract--In sub-100 nm CMOS processes, delay and leakage power reduction continue to be among the most critical design concerns. We propose to exploit the recent availability of f...
Kwangok Jeong, Andrew B. Kahng, Chul-Hong Park, Ha...
DCG
2010
67views more  DCG 2010»
14 years 9 months ago
Conformal Mapping in Linear Time
Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...
Christopher J. Bishop