1532 search results - page 305 / 307 » The Symbol Grounding Problem |
113
click to vote
USS
2010
14 years 7 months ago
2010
Web applications are the most common way to make services and data available on the Internet. Unfortunately, with the increase in the number and complexity of these applications, ...
95
Voted
CORR
2010
Springer
14 years 6 months ago
2010
Springer
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization ...
INFSOF
2010
14 years 6 months ago
2010
Buffer overflow detection using static analysis can provide a powerful tool for software ers to find difficult bugs in C programs. Sound static analysis based on abstract interpre...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....