Sciweavers

191 search results - page 25 / 39
» The basic feasible functionals in computable analysis
Sort
View
FOCS
2007
IEEE
15 years 6 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
ICCAD
1997
IEEE
112views Hardware» more  ICCAD 1997»
15 years 4 months ago
Circuit optimization via adjoint Lagrangians
The circuit tuning problem is best approached by means of gradient-based nonlinear optimization algorithms. For large circuits, gradient computation can be the bottleneck in the o...
Andrew R. Conn, Ruud A. Haring, Chandramouli Viswe...
ISBI
2008
IEEE
15 years 6 months ago
An optimal-path approach for neural circuit reconstruction
Neurobiologists are collecting large amounts of electron microscopy image data to gain a better understanding of neuron organization in the central nervous system. Image analysis ...
Elizabeth Jurrus, Ross T. Whitaker, Bryan W. Jones...
ICPP
2002
IEEE
15 years 4 months ago
The Tracefile Testbed - A Community Repository for Identifying and Retrieving HPC Performance Data
HPC programmers utilize tracefiles, which record program behavior in great detail, as the basis for many performance analysis activities. The lack of generally accessible tracefil...
Ken Ferschweiler, Scott Harrah, Dylan Keon, Mariac...
E4MAS
2005
Springer
15 years 5 months ago
A Survey of Environments and Mechanisms for Human-Human Stigmergy
Stigmergy (the coordination of agents through signs they make and sense in a shared environment) was originally articulated in the study of social insects. Its basic processes are ...
H. Van Dyke Parunak