Sciweavers

1806 search results - page 243 / 362
» Some Functions Computable with a Fused-Mac
Sort
View
JCNS
2000
165views more  JCNS 2000»
15 years 6 months ago
A Population Density Approach That Facilitates Large-Scale Modeling of Neural Networks: Analysis and an Application to Orientati
We explore a computationally efficient method of simulating realistic networks of neurons introduced by Knight, Manin, and Sirovich (1996) in which integrate-and-fire neurons are ...
Duane Q. Nykamp, Daniel Tranchina
JOC
2010
123views more  JOC 2010»
15 years 1 months ago
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
Yonatan Aumann, Yehuda Lindell
JSA
2000
175views more  JSA 2000»
15 years 6 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
TIP
2002
131views more  TIP 2002»
15 years 6 months ago
Optimal edge-based shape detection
Abstract--We propose an approach to accurately detecting twodimensional (2-D) shapes. The cross section of the shape boundary is modeled as a step function. We first derive a one-d...
Hankyu Moon, Rama Chellappa, Azriel Rosenfeld
COR
2007
106views more  COR 2007»
15 years 5 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...