Sciweavers

1225 search results - page 80 / 245
» The Instance Complexity Conjecture
Sort
View
CJ
2010
114views more  CJ 2010»
13 years 9 months ago
Using the Relational Model to Capture Topological Information of Spaces
Abstract. Motivated by research on how topology may be a helpful foundation for building information modeling (BIM), a relational database version of the notions of chain complex a...
Patrick Erik Bradley, Norbert Paul
COMPLEXITY
2004
108views more  COMPLEXITY 2004»
13 years 9 months ago
On the convergence of a factorized distribution algorithm with truncation selection
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
Qingfu Zhang
UC
2005
Springer
14 years 2 months ago
A Computational Model for Self-assembling Flexible Tiles
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
Natasa Jonoska, Gregory L. McColm
INFOVIS
2002
IEEE
14 years 2 months ago
Arc Diagrams: Visualizing Structure in Strings
This paper introduces a new visualization method, the arc diagram, which is capable of representing complex patterns of repetition in string data. Arc diagrams improve over previo...
Martin Wattenberg
SIAMJO
2008
93views more  SIAMJO 2008»
13 years 9 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont