Sciweavers

2107 search results - page 105 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
124
Voted
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
15 years 8 months ago
Statistical Timing Analysis Using Bounds
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...
Aseem Agarwal, David Blaauw, Vladimir Zolotov, Sar...
ICCV
2009
IEEE
2171views Computer Vision» more  ICCV 2009»
16 years 7 months ago
Fast Visibility Restoration from a Single Color or Gray Level Image
One source of difficulties when processing outdoor images is the presence of haze, fog or smoke which fades the colors and reduces the contrast of the observed objects. We introdu...
Jean-Philippe Tarel and Nicolas Hautière
KR
2004
Springer
15 years 8 months ago
Discovering State Invariants
We continue to advocate a methodology that we used earlier for pattern discovery through exhaustive search in selected small domains. This time we apply it to the problem of disco...
Fangzhen Lin
CVPR
2008
IEEE
15 years 3 months ago
Robust learning of discriminative projection for multicategory classification on the Stiefel manifold
Learning a robust projection with a small number of training samples is still a challenging problem in face recognition, especially when the unseen faces have extreme variation in...
Duc-Son Pham, Svetha Venkatesh
TCS
2008
15 years 3 months ago
Computational self-assembly
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language . That language is primarily m...
Pierre-Louis Curien, Vincent Danos, Jean Krivine, ...