Sciweavers

2208 search results - page 404 / 442
» Memory Practices in the Sciences
Sort
View
ICDE
2007
IEEE
161views Database» more  ICDE 2007»
16 years 13 days ago
How to scalably and accurately skip past streams
Data stream methods look at each new item of the stream, perform a small number of operations while keeping a small amount of memory, and still perform muchneeded analyses. Howeve...
Supratik Bhattacharyya, André Madeira, S. M...
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
16 years 13 days ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
TASE
2007
IEEE
16 years 12 days ago
Evaluation of SAT-based Bounded Model Checking of ACTL Properties
Bounded model checking (BMC) based on SAT has been introduced as a complementary method to BDD-based symbolic model checking of LTL and ACTL properties in recent years. For genera...
Yanyan Xu, Wei Chen, Liang Xu, Wenhui Zhang
ALGOSENSORS
2007
Springer
16 years 9 days ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
HIPEAC
2007
Springer
16 years 8 days ago
A Throughput-Driven Task Creation and Mapping for Network Processors
Abstract. Network processors are programmable devices that can process packets at a high speed. A network processor is typified by multithreading and heterogeneous multiprocessing...
Lixia Liu, Xiao-Feng Li, Michael K. Chen, Roy Dz-C...