Sciweavers

2638 search results - page 37 / 528
» Random Geometric Complexes
Sort
View
TOC
2010
106views Management» more  TOC 2010»
14 years 8 months ago
Separating Deterministic from Randomized Multiparty Communication Complexity
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
GECCO
2009
Springer
15 years 6 months ago
The sensitivity of HyperNEAT to different geometric representations of a problem
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
Jeff Clune, Charles Ofria, Robert T. Pennock
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
15 years 7 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
ISAAC
2010
Springer
266views Algorithms» more  ISAAC 2010»
14 years 12 months ago
Structural and Complexity Aspects of Line Systems of Graphs
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
Jozef Jirásek, Pavel Klavík