Sciweavers

2297 search results - page 93 / 460
» A fast APRIORI implementation
Sort
View
SEFM
2008
IEEE
15 years 5 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
ICC
2007
IEEE
159views Communications» more  ICC 2007»
15 years 5 months ago
The Performance of Coded Non-Coherent M-ary Orthogonal Keying Based OFDM Systems in a Frequency Selective and Fast Time-Varying
In this paper, we investigate the application of a unipolar Non-Coherent M-ary Orthogonal Keying (NC-MOK) for OFDM system that does not require channel estimation and compare its p...
Mohammed W. Baidas, Timothy O'Farrell
81
Voted
DIS
2007
Springer
15 years 5 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki
IVA
2007
Springer
15 years 5 months ago
Towards Fast Prototyping of IVAs Behavior: Pogamut 2
We present the platform for IVAs development in the human like environment of the first-person shooter game Unreal Tournament 2004. This environment is extendible and supported by ...
Ondrej Burkert, Rudolf Kadlec, Jakub Gemrot, Micha...
GLOBECOM
2006
IEEE
15 years 5 months ago
Fast Robust Hashing
Abstract— As stateful flow-aware services are becoming commonplace, distributed router architectures have to quickly assign packets being forwarded to service-specialized proces...
Manuel Urueña, David Larrabeiti, Pablo Serr...