Sciweavers

61 search results - page 7 / 13
» Graph-optimized locality preserving projections
Sort
View
PLDI
2000
ACM
13 years 12 months ago
Optimal instruction scheduling using integer programming
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
Kent D. Wilken, Jack Liu, Mark Heffernan
ICIP
2005
IEEE
14 years 9 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
2007
IEEE
159views Data Mining» more  ICDM 2007»
13 years 11 months ago
Spectral Regression: A Unified Approach for Sparse Subspace Learning
Recently the problem of dimensionality reduction (or, subspace learning) has received a lot of interests in many fields of information processing, including data mining, informati...
Deng Cai, Xiaofei He, Jiawei Han
AISB
1995
Springer
13 years 11 months ago
An Evolutionary Algorithm for Parametric Array Signal Processing
This paper presents an evolutionary algorithm for solving parameter optimization problems in parametric array signal processing. The method utilises the niche concept to maintain a...
Dekun Yang, Stuart J. Flockton
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 2 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer