Sciweavers

677 search results - page 61 / 136
» Reducing the Space Requirement of LZ-Index
Sort
View
NIPS
2000
14 years 11 months ago
APRICODD: Approximate Policy Construction Using Decision Diagrams
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...
Robert St-Aubin, Jesse Hoey, Craig Boutilier
TWC
2008
113views more  TWC 2008»
14 years 9 months ago
Two-dimensional coded classification schemes in wireless sensor networks
Abstract-- This work proposes a novel fault-tolerant classification system based on distributed detection and two-dimensional channel coding. A rule is then derived to reduce the s...
Hung-Ta Pai, Yunghsiang S. Han, Jing-Tian Sung
CJ
2002
67views more  CJ 2002»
14 years 9 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
ICCMS
2009
118views more  ICCMS 2009»
14 years 7 months ago
Optimized Parallel Implementation of Gillespie's First Reaction Method on Graphics Processing Units
The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochas...
Cristian Dittamo, Davide Cangelosi
ICNP
2007
IEEE
15 years 4 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...