3690 search results - page 384 / 738 » Computation with classical sequents |
155
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, the matching of SIFT-like features [5] between images is studied. The goal is to decide which matches between descriptors of two datasets should be selected. This m...
163
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
The covariance region descriptor recently proposed in [1] has been proved robust and versatile for a modest computational cost. The covariance matrix enables efficient fusion of d...
169
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Estimating relative camera motion from two views is a classical problem in computer vision. The minimal case for such problem is the so-called five-point-problem, for which the st...
168
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
169
click to vote
MOBIHOC
2001
ACM
16 years 6 months ago
2001
ACM
Ubiquitous computing environments are typically based upon ad hoc networks of mobile computing devices. These devices may be equipped with sensor hardware to sense the physical en...