Sciweavers

4934 search results - page 160 / 987
» complexity 2008
Sort
View
PRL
2008
88views more  PRL 2008»
15 years 4 months ago
Time-efficient spam e-mail filtering using n-gram models
In this paper, we propose spam e-mail filtering methods having high accuracies and low time complexities. The methods are based on the n-gram approach and a heuristics which is re...
Ali Çiltik, Tunga Güngör
TPDS
2008
125views more  TPDS 2008»
15 years 4 months ago
Computation-Efficient Multicast Key Distribution
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
Lihao Xu, Cheng Huang
SIMUTOOLS
2008
15 years 5 months ago
SIMCAN: a SIMulator framework for computer architectures and storage networks
This paper presents an OMNeT-based Framework to simulate large complex storage networks, with its corresponding underlying subsystems (I/O, Networking, etc.). With this Framework,...
Alberto Nuñez, Javier Fernández, Jos...
TIT
1998
123views more  TIT 1998»
15 years 4 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu
TOG
2008
79views more  TOG 2008»
15 years 4 months ago
Continuous model synthesis
We present a novel method for procedurally modeling large complex shapes. Our approach is general-purpose and takes as input any 3D polyhedral model provided by a user. The algori...
Paul Merrell, Dinesh Manocha