Sciweavers

972 search results - page 36 / 195
» Performance of data networks with random links
Sort
View
SIGMETRICS
2004
ACM
106views Hardware» more  SIGMETRICS 2004»
16 years 1 days ago
Performance analysis of BSTs in system software
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
Ben Pfaff
CIA
2007
Springer
16 years 24 days ago
High-Performance Agent System for Intrusion Detection in Backbone Networks
Abstract. This paper presents a design of high-performance agentbased intrusion detection system designed for deployment on high-speed network links. To match the speed requirement...
Martin Rehák, Michal Pechoucek, Pavel Celed...
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 7 months ago
Learning a complex metabolomic dataset using random forests and support vector machines
Metabolomics is the omics science of biochemistry. The associated data include the quantitative measurements of all small molecule metabolites in a biological sample. These datase...
Young Truong, Xiaodong Lin, Chris Beecher
ICML
2006
IEEE
16 years 7 months ago
Cost-sensitive learning with conditional Markov networks
There has been a recent, growing interest in classification and link prediction in structured domains. Methods such as conditional random fields and relational Markov networks sup...
Prithviraj Sen, Lise Getoor
AINA
2007
IEEE
16 years 1 months ago
Efficient Hybrid Channel Access for Data Intensive Sensor Networks
In this paper, we introduce novel probabilistic transmission protocols for data intensive wireless sensor networks. The protocols combine a randomized transmission scheme with sch...
Chih-Kuang Lin, Vladimir Zadorozhny, Prashant Kris...