370 search results - page 23 / 74 » Bounded modified realizability |
FPGA
1997
ACM
15 years 4 months ago
1997
ACM
Event identification in photon counting ICCD detectors requires a high level image analysis which cannot be easily described algorithmically: neural networks are promising to appr...
109
click to vote
ICRA
1994
IEEE
15 years 3 months ago
1994
IEEE
We present a simple approach for planning the motion of nonholonomic robots among obstacles. Existing methods lead to open-loop solutions which are either obtained in two stages, ...
FCCM
2009
IEEE
15 years 3 months ago
2009
IEEE
This paper proposes a high performance least square solver on FPGAs using the Cholesky decomposition method. Our design can be realized by iteratively adopting a single triangular...
ACL
2008
15 years 1 months ago
2008
Frequency counts from very large corpora, such as the Web 1T dataset, have recently become available for language modeling. Omission of low frequency n-gram counts is a practical ...
WAE
2001
15 years 1 months ago
2001
Abstract. A new realization of a space-efficient deque is presented. The data structure is constructed from three singly resizable arrays, each of which is a blockwiseallocated pil...