Sciweavers

1819 search results - page 74 / 364
» Computability and Representations of the Zero Set
Sort
View
TOG
2012
267views Communications» more  TOG 2012»
13 years 8 days ago
Global parametrization by incremental flattening
Global parametrization of surfaces requires singularities (cones) to keep distortion minimal. We describe a method for finding cone locations and angles and an algorithm for glob...
Ashish Myles, Denis Zorin
GECCO
2010
Springer
153views Optimization» more  GECCO 2010»
15 years 1 months ago
Multi-task evolutionary shaping without pre-specified representations
Shaping functions can be used in multi-task reinforcement learning (RL) to incorporate knowledge from previously experienced tasks to speed up learning on a new task. So far, rese...
Matthijs Snel, Shimon Whiteson
BMCBI
2010
163views more  BMCBI 2010»
14 years 10 months ago
Reduced representation of protein structure: implications on efficiency and scope of detection of structural similarity
Background: Computational comparison of two protein structures is the starting point of many methods that build on existing knowledge, such as structure modeling (including modeli...
Zong Hong Zhang, Hwee Kuan Lee, Ivana Mihalek
DOCENG
2010
ACM
14 years 10 months ago
Next generation typeface representations: revisiting parametric fonts
Outline font technology has long been established as the standard way to represent typefaces, allowing characters to be represented independently of print size and resolution. Alt...
Tamir Hassan, Changyuan Hu, Roger D. Hersch
COMPGEOM
2004
ACM
15 years 3 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato