1813 search results - page 68 / 363 » Calculi of Approximation Spaces |
165
click to vote
ICPR
2008
IEEE
16 years 21 days ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
147
click to vote
ACCV
2006
Springer
16 years 8 days ago
2006
Springer
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...
150
click to vote
ZUM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We describe a method for combining formal program development with a disciplined and documented way of introducing realistic compromises, for example necessitated by reso...
186
click to vote
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
In the digital VLSI cycle, logic transformations are often required to modify the design to meet different synthesis and optimization goals. Logic transformations on sequential ci...
163
click to vote
SMILE
2000
Springer
15 years 9 months ago
2000
Springer
In this paper, we explore the more practical aspects of building and rendering concentric mosaics. First, we use images captured with only approximately circular camera trajectorie...