3172 search results - page 155 / 635 » On the Random-Self-Reducibility of Complete Sets |
155
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
165
click to vote
ACSC
2007
IEEE
16 years 25 days ago
2007
IEEE
Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its ...
172
click to vote
CEC
2007
IEEE
16 years 25 days ago
2007
IEEE
Abstract— For the past decade or so, evolutionary multiobjective optimization (EMO) methodologies have earned wide popularity for solving complex practical optimization problems,...
162
click to vote
INFOCOM
2007
IEEE
16 years 23 days ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
201
click to vote
RSP
2007
IEEE
16 years 23 days ago
2007
IEEE
A widely used approach to avoid network intrusion is SNORT, an open source Network Intrusion Detection System (NIDS). This work describes SPP-NIDS, a architecture for intrusion de...