Sciweavers

1390 search results - page 96 / 278
» Computing the depth of a flat
Sort
View
SPAA
2009
ACM
15 years 2 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
SIGGRAPH
2010
ACM
15 years 2 months ago
Apparent layer operations for the manipulation of deformable objects
We introduce layer operations for single-view 3D deformable object manipulation, in which the user can control the depth order of layered 3D objects resting on a flat ground with...
Takeo Igarashi, Jun Mitani
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
15 years 3 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
DNA
2009
Springer
173views Bioinformatics» more  DNA 2009»
15 years 4 months ago
Time-Complexity of Multilayered DNA Strand Displacement Circuits
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
Georg Seelig, David Soloveichik