43264 search results - page 436 / 8653 » Comparing models of computation |
128
click to vote
WABI
2007
Springer
15 years 11 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
141
click to vote
JCP
2006
15 years 5 months ago
2006
In this paper, we discuss a general methodology for analysis and modeling of trust relationships in distributed computing. We discuss the classification of trust relationships, cat...
176
click to vote
IPPS
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper we propose an efficient real-time communication mechanism for distributed vision processing. One of the biggest problems of distributed vision processing, as is the ...
141
click to vote
HPCC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract--This paper examines the initial parallel implementation of SCATTER, a computationally intensive inelastic neutron scattering routine with polycrystalline averaging capabi...
103
click to vote
TCS
1998
15 years 4 months ago
1998
In this paper we present an alternative order-theoretic proof of the Banach fixed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary...