Sciweavers

580 search results - page 111 / 116
» Performance evaluation of petri nets execution algorithms
Sort
View
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
14 years 4 months 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
CODES
2005
IEEE
14 years 4 months ago
CRAMES: compressed RAM for embedded systems
Memory is a scarce resource in many embedded systems. Increasing memory often increases packaging and cooling costs, size, and energy consumption. This paper presents CRAMES, an e...
Lei Yang, Robert P. Dick, Haris Lekatsas, Srimat T...
HIPEAC
2011
Springer
12 years 10 months ago
TypeCastor: demystify dynamic typing of JavaScript applications
Dynamic typing is a barrier for JavaScript applications to achieve high performance. Compared with statically typed languages, the major overhead of dynamic typing comes from runt...
Shisheng Li, Buqi Cheng, Xiao-Feng Li
CLUSTER
2006
IEEE
14 years 4 months ago
MSSG: A Framework for Massive-Scale Semantic Graphs
This paper presents a middleware framework for storing, accessing and analyzing massive-scale semantic graphs. The framework, MSSG, targets scale-free semantic graphs with O(1012 ...
Timothy D. R. Hartley, Ümit V. Çataly&...
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 10 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid