424 search results - page 76 / 85 » Realizability models and implicit complexity |
143
Voted
ANCS
2007
ACM
15 years 7 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
138
click to vote
IADIS
2004
15 years 4 months ago
2004
Today, the development of a VR application is still a long and difficult task. You need to be skilled in Virtual Reality (VR) technology to be able to develop a Virtual World. The...
162
Voted
IANDC
2007
15 years 3 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
157
click to vote
ICCV
1999
IEEE
16 years 5 months ago
1999
IEEE
A Bayesian framework for deformable pattern classification has been proposed in [1] with promising results for isolated handwritten character recognition. Its performance, however...
136
Voted
PODS
2002
ACM
16 years 3 months ago
2002
ACM
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...