Sciweavers

294 search results - page 55 / 59
» Formal Verification of the Implementability of Timing Requir...
Sort
View
POPL
2008
ACM
14 years 7 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
DSD
2009
IEEE
144views Hardware» more  DSD 2009»
14 years 2 months ago
Composable Resource Sharing Based on Latency-Rate Servers
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
Benny Akesson, Andreas Hansson, Kees Goossens
WAPCV
2004
Springer
14 years 21 days ago
Towards a Biologically Plausible Active Visual Search Model
Abstract. This paper proposes a neuronal-based solution to active visual search, that is, visual search for a given target in displays that are too large in spatial extent to be in...
Andrei Zaharescu, Albert L. Rothenstein, John K. T...
TMI
2011
127views more  TMI 2011»
13 years 2 months ago
Reconstruction of Large, Irregularly Sampled Multidimensional Images. A Tensor-Based Approach
Abstract—Many practical applications require the reconstruction of images from irregularly sampled data. The spline formalism offers an attractive framework for solving this prob...
Oleksii Vyacheslav Morozov, Michael Unser, Patrick...
BIRTHDAY
2005
Springer
14 years 27 days ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau