Sciweavers

122 search results - page 23 / 25
» Error tolerant associative memory
Sort
View
SIAMDM
2010
149views more  SIAMDM 2010»
13 years 5 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
CGO
2010
IEEE
14 years 1 months ago
Towards program optimization through automated analysis of numerical precision
Reducing the arithmetic precision of a computation has real performance implications, including increased speed, decreased power consumption, and a smaller memory footprint. For s...
Michael D. Linderman, Matthew Ho, David L. Dill, T...
DSN
2005
IEEE
14 years 16 days ago
Checking Array Bound Violation Using Segmentation Hardware
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
Lap-Chung Lam, Tzi-cker Chiueh
ISCA
2009
IEEE
199views Hardware» more  ISCA 2009»
14 years 1 months ago
SigRace: signature-based data race detection
Detecting data races in parallel programs is important for both software development and production-run diagnosis. Recently, there have been several proposals for hardware-assiste...
Abdullah Muzahid, Darío Suárez Graci...
CN
2008
110views more  CN 2008»
13 years 7 months ago
The eternal sunshine of the sketch data structure
In the past years there has been significant research on developing compact data structures for summarizing large data streams. A family of such data structures is the so-called s...
Xenofontas A. Dimitropoulos, Marc Ph. Stoecklin, P...