1615 search results - page 180 / 323 » Computer science and decision theory |
119
Voted
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
87
Voted
STOC
2001
ACM
16 years 1 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
93
Voted
CAD
2005
Springer
15 years 21 days ago
2005
Springer
Performance of various functions of the tissue structure depends on porous scaffold microstructures with specific porosity characteristics that influence the behavior of the incor...
ISVD
2010
IEEE
14 years 11 months ago
2010
IEEE
—We study the topology of the Megaparsec Cosmic Web on the basis of the Alpha Shapes of the galaxy distribution. The simplicial complexes of the alpha shapes are used to determin...
124
click to vote
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...