Sciweavers

667 search results - page 27 / 134
» Computably Based Locally Compact Spaces
Sort
View
ICCV
2007
IEEE
14 years 2 months ago
Non-Rigid Object Alignment with a Mismatch Template Based on Exhaustive Local Search
Non-rigid object alignment is especially challenging when only a single appearance template is available and target and template images fail to match. Two sources of discrepancy b...
Yang Wang, Simon Lucey, Jeffrey F. Cohn
IEEEPACT
1998
IEEE
14 years 4 days ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
14 years 2 months ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg
ICCV
2007
IEEE
14 years 9 months ago
Contour Grouping Based on Local Symmetry
The paper deals with grouping of edges to contours of shapes using only local symmetry and continuity. Shape skeletons are used to generate the search space for a version of the M...
Nagesh Adluru, Longin Jan Latecki, Rolf Lakäm...
COMGEO
2002
ACM
13 years 7 months ago
Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited
The goals of this paper are twofold. The first is to present a new sampling theory for curves, based on a new notion of local feature size. The properties of this new feature size...
Daniel Freedman