Sciweavers

219 search results - page 30 / 44
» Fast Algorithms for Finding Extremal Sets
Sort
View
DFT
2003
IEEE
64views VLSI» more  DFT 2003»
14 years 27 days ago
Hybrid BIST Time Minimization for Core-Based Systems with STUMPS Architecture
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, ...
CJ
2011
12 years 11 months ago
Dynamic Multipath Allocation in Ad Hoc Networks
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/â...
Yosi Ben-Asher, Sharoni Feldman, Moran Feldman
CVPR
2012
IEEE
11 years 10 months ago
Learning latent temporal structure for complex event detection
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
Kevin Tang, Fei-Fei Li, Daphne Koller
DCC
2006
IEEE
14 years 7 months ago
Data Compression with Restricted Parsings
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
John T. Robinson, Luis Alfonso Lastras-Monta&ntild...
CVPR
2010
IEEE
1192views Computer Vision» more  CVPR 2010»
14 years 4 months ago
RASL: Robust Alignment by Sparse and Low-rank Decomposition for Linearly Correlated Images
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...
Yigang Peng, Arvind Balasubramanian, John Wright, ...