Sciweavers

1029 search results - page 136 / 206
» Local Minima Embedding
Sort
View
CVPR
2007
IEEE
16 years 5 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
ICIP
2005
IEEE
16 years 4 months ago
Semifragile hierarchical watermarking in a set theoretic framework
We introduce a set theoretic framework for watermarking and illustrate its effectiveness by designing a hierarchical semi-fragile watermark that is tolerant to compression and all...
Oktay Altun, Gaurav Sharma, Mehmet Utku Celik, Mar...
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
15 years 8 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad
HM
2005
Springer
140views Optimization» more  HM 2005»
15 years 8 months ago
Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
Herman Sontrop, Pieter van der Horn, Marc Uetz
CODES
2000
IEEE
15 years 7 months ago
Co-design of interleaved memory systems
Memory interleaving is a cost-efficient approach to increase bandwidth. Improving data access locality and reducing memory access conflicts are two important aspects to achieve hi...
Hua Lin, Wayne Wolf