Sciweavers

613 search results - page 98 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
AAAI
2007
13 years 11 months ago
On the Partial Observability of Temporal Uncertainty
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
Michael D. Moffitt
DAC
2005
ACM
13 years 10 months ago
Multi-frequency wrapper design and optimization for embedded cores under average power constraints
This paper presents a new method for designing test wrappers for embedded cores with multiple clock domains. By exploiting the use of multiple shift frequencies, the proposed meth...
Qiang Xu, Nicola Nicolici, Krishnendu Chakrabarty
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 6 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
ICASSP
2007
IEEE
14 years 2 months ago
Breaking the Limitation of Manifold Analysis for Super-Resolution of Facial Images
A novel method for robust super-resolution offace images is proposed in this paper. Face super-resolution is a particular interest in video surveillance where face images have typ...
Sung Won Park, Marios Savvides
FPGA
2005
ACM
80views FPGA» more  FPGA 2005»
14 years 2 months ago
Simultaneous timing-driven placement and duplication
Logic duplication is an effective method for improving circuit performance. In this paper we present an algorithm named SPD that performs simultaneous placement and duplication to...
Gang Chen, Jason Cong