Sciweavers

2219 search results - page 406 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ICCV
2011
IEEE
14 years 2 months ago
Informative Feature Selection for Object Recognition via Sparse PCA
Bag-of-words (BoW) methods are a popular class of object recognition methods that use image features (e.g., SIFT) to form visual dictionaries and subsequent histogram vectors to r...
Nikhil Naikal, Allen Y. Yang, S. Shankar Sastry
ICML
2006
IEEE
16 years 2 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
16 years 2 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne
IEEEPACT
2008
IEEE
15 years 8 months ago
Exploiting loop-dependent stream reuse for stream processors
The memory access limits the performance of stream processors. By exploiting the reuse of data held in the Stream Register File (SRF), an on-chip storage, the number of memory acc...
Xuejun Yang, Ying Zhang, Jingling Xue, Ian Rogers,...
COLOGNETWENTE
2010
14 years 10 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...