Sciweavers

1300 search results - page 7 / 260
» Toward network data independence
Sort
View
80
Voted
JETAI
1998
110views more  JETAI 1998»
14 years 10 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
82
Voted
ICPR
2008
IEEE
15 years 4 months ago
A network intrusion detection method using independent component analysis
An intrusion detection system (IDS) detects illegal manipulations of computer systems. In intrusion detection systems, feature reduction, including feature extraction and feature ...
Dayu Yang, Hairong Qi
INFOCOM
2011
IEEE
14 years 2 months ago
VIRO: A scalable, robust and namespace independent virtual Id routing for future networks
—In this paper we propose VIRO — a novel, virtual identifier (Id) routing paradigm for future networks. The objective is three-fold. First, VIRO directly addresses the challen...
Sourabh Jain, Yingying Chen, Zhi-Li Zhang
TWC
2010
14 years 5 months ago
Toward network coding-based protocols for data broadcasting in wireless Ad Hoc networks
In this paper we consider practical dissemination algorithms exploiting network coding for data broadcasting in ad hoc wireless networks. For an efcient design, we analyze issues r...
Alfred Asterjadhi, Elena Fasolo, Michele Rossi, J&...
121
Voted
PVLDB
2010
125views more  PVLDB 2010»
14 years 8 months ago
MapMerge: Correlating Independent Schema Mappings
One of the main steps towards integration or exchange of data is to design the mappings that describe the (often complex) relationships between the source schemas or formats and t...
Bogdan Alexe, Mauricio A. Hernández, Lucian...