Sciweavers

43264 search results - page 8485 / 8653
» Comparing models of computation
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 1 months ago
Efficient Expected-Case Algorithms for Planar Point Location
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...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
ICPP
1997
IEEE
15 years 1 months ago
The Affinity Entry Consistency Protocol
In this paper we propose a novel software-only distributed sharedmemory system (SW-DSM), the Affinity Entry Consistency (AEC) protocol. The protocol is based on Entry Consistency ...
Cristiana Bentes Seidel, Ricardo Bianchini, Claudi...
105
Voted
ICCV
1995
IEEE
15 years 1 months ago
Closed-World Tracking
A new approach to tracking weakly modeled objects in a semantically rich domain is presented. We define a closed-world as a space-time region of an image sequence in which the co...
Stephen S. Intille, Aaron F. Bobick
ICCV
1995
IEEE
15 years 1 months ago
Recognizing 3D Objects Using Photometric Invariant
In this paper we describe a new e cient algorithm for recognizing 3D objects by combining photometric and geometric invariants. Some photometric properties are derived, that are i...
Kenji Nagao
ICDCS
1995
IEEE
15 years 1 months ago
Specifying Weak Sets
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
Jeannette M. Wing, David C. Steere
« Prev « First page 8485 / 8653 Last » Next »