1221 search results - page 135 / 245 » A Comparison of Two Programming Models for Pervasive Computi... |
172
click to vote
SWAT
2000
Springer
15 years 9 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
184
click to vote
DAC
2006
ACM
15 years 8 months ago
2006
ACM
Software-based self-test (SBST) has recently emerged as an effective methodology for the manufacturing test of processors and other components in systems-on-chip (SoCs). By moving ...
134
click to vote
ICMCS
2007
IEEE
16 years 18 days ago
2007
IEEE
Contextual information is important for sequence modeling. Hidden Markov Models (HMMs) and extensions, which have been widely used for sequence modeling, make simplifying, often u...
164
click to vote
IROS
2006
IEEE
16 years 9 days ago
2006
IEEE
Model-based recognition of an object typically involves matching dense 3D range data. The computational cost is directly affected by the amount of data of which a transformation n...
177
click to vote
PPOPP
1993
ACM
15 years 10 months ago
1993
ACM
This paper discusses some of the issues involved in implementing a shared-address space programming model on large-scale, distributed-memory multiprocessors. While such a programm...