Sciweavers

1578 search results - page 254 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
14 years 4 months ago
Virtually Pipelined Network Memory
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
Banit Agrawal, Timothy Sherwood
VISUALIZATION
2005
IEEE
14 years 3 months ago
A Shader-Based Parallel Rendering Framework
Existing parallel or remote rendering solutions rely on communicating pixels, OpenGL commands, scene-graph changes or application-specific data. We propose an intermediate soluti...
Jérémie Allard, Bruno Raffin
MOBICOM
2010
ACM
13 years 10 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
BMCBI
2008
214views more  BMCBI 2008»
13 years 10 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
TKDE
2011
528views more  TKDE 2011»
13 years 4 months ago
The CoQUOS Approach to Continuous Queries in Unstructured Overlays
—The current peer-to-peer (P2P) content distribution systems are constricted by their simple on-demand content discovery mechanism. The utility of these systems can be greatly en...
Lakshmish Ramaswamy, Jianxia Chen