Search
Now showing items 81-90 of 136
A lossy, dictionary -based method for short message service (SMS) text compression
(2009)
Short message service (SMS) message compression allows either more content to be fitted into a single message or fewer individual messages to be sent as part of a concatenated (or long) message. While essentially only ...
A hybrid scavenger grid approach to intranet search
(2009)
According to a 2007 global survey of 178 organisational intranets, 3 out of 5 organisations are not satisfied with their intranet search services. However, as intranet data collections become large, effective full-text ...
ATAC: A Manycore Processor with On-Chip Optical Network
(2009-05-05)
Ever since industry has turned to parallelism instead of frequency scaling to improve processor performance, multicore processors have continued to scale to larger and larger numbers of cores. Some believe that multicores ...
Remote Store Programming: Mechanisms and Performance
(2009-05-05)
This paper presents remote store programming (RSP). This paradigm combines usability and efficiency through the exploitation of a simple hardware mechanism, the remote store, which can easily be added to existing ...
Fragment Grammars: Exploring Computation and Reuse in Language
(2009-03-31)
Language relies on a division of labor between stored units and structure building operations which combine the stored units into larger structures. This division of labor leads to a tradeoff: more structure-building means ...
Risk Allocation for Multi-agent Systems using Tatonnement
(2009-04-22)
This paper proposes a new market-based distributed planning algorithm for multi-agent systems under uncertainty, called MIRA (Market-based Iterative Risk Allocation). In large coordination problems, from power grid management ...
Oblivious Routing in On-Chip Bandwidth-Adaptive Networks
(2009-03-27)
Oblivious routing can be implemented on simple router hardware, but network performance suffers when routes become congested. Adaptive routing attempts to avoid hot spots by re-routing flows, but requires more complex ...
Finding Bugs in Web Applications Using Dynamic Test Generation and Explicit State Model Checking
(2009-03-26)
Web script crashes and malformed dynamically-generated web pages are common errors, and they seriously impact the usability of web applications. Current tools for web-page validation cannot handle the dynamically generated ...
Understanding and evaluating blind deconvolution algorithms
(2009-03-31)
Blind deconvolution is the recovery of a sharp version of a blurred image when the blur kernel is unknown. Recent algorithms have afforded dramatic progress, yet many aspects of the problem remain challenging and hard to ...
Computing Network Coordinates in the Presence of Byzantine Faults
(2009-04-16)
Network coordinate systems allow for efficient construction of large-scale distributed systems on the Internet. Coordinates provide locality information in a compact way, without requiring each node to contact every potential ...