Sciweavers

1336 search results - page 129 / 268
» SMTP Path Analysis
Sort
View
IPPS
1998
IEEE
14 years 1 months ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
ICCAD
1996
IEEE
102views Hardware» more  ICCAD 1996»
14 years 1 months ago
Bit-flipping BIST
A scan-based BIST scheme is presented which guarantees complete fault coverage with very low hardware overhead. A probabilistic analysis shows that the output of an LFSR which fee...
Hans-Joachim Wunderlich, Gundolf Kiefer
GLVLSI
2010
IEEE
154views VLSI» more  GLVLSI 2010»
13 years 11 months ago
Resource-constrained timing-driven link insertion for critical delay reduction
For timing-driven or yield-driven designs, non-tree routing has become more and more popular and additional loops provide the redundant paths to protect against the effect of the ...
Jin-Tai Yan, Zhi-Wei Chen
ACL
2008
13 years 10 months ago
Finding Contradictions in Text
Detecting conflicting statements is a foundational text understanding task with applications in information analysis. We propose an appropriate definition of contradiction for NLP...
Marie-Catherine de Marneffe, Anna N. Rafferty, Chr...
ICVGIP
2008
13 years 10 months ago
Frequency Domain Visual Servoing Using Planar Contours
Fourier domain methods have had a long association with geometric vision. In this paper, we introduce Fourier domain methods into the field of visual servoing for the first time. ...
Visesh Chari, Avinash Sharma, Anoop M. Namboodiri,...