Sciweavers

2373 search results - page 33 / 475
» Complexities for generalized models of self-assembly
Sort
View
DLT
2003
15 years 5 months ago
Complexity Theory Made Easy
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
Heribert Vollmer
VISUALIZATION
1998
IEEE
15 years 8 months ago
A general method for preserving attribute values on simplified meshes
Many sophisticated solutions have been proposed to reduce the geometric complexity of 3D meshes. A less studied problem is how to preserve on a simplified mesh the detail (e.g. co...
Paolo Cignoni, Claudio Montani, Roberto Scopigno, ...
ECCC
2011
202views ECommerce» more  ECCC 2011»
14 years 11 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain
CIG
2006
IEEE
15 years 10 months ago
Voronoi game on graphs and its complexity
The Voronoi game is a two-person game which is a model for a competitive facility location. The game is done on a continuous domain, and only two special cases (1-dimensional case ...
Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
SMA
1997
ACM
152views Solid Modeling» more  SMA 1997»
15 years 8 months ago
Structured Topological Complexes: A Feature-Based API for Non-Manifold Topologies
Much of recent research in representation schemes for solid modeling was focused on the extension of boundary representations to support non-manifold topologies. We introduce here...
Jarek Rossignac