Sciweavers

1129 search results - page 133 / 226
» Scalable ontology-based information systems
Sort
View
SAC
2002
ACM
15 years 6 months ago
Statistical properties of the simulated time horizon in conservative parallel discrete-event simulations
We investigate the universal characteristics of the simulated time horizon of the basic conservative parallel algorithm when implemented on regular lattices. This technique [1, 2]...
G. Korniss, M. A. Novotny, A. K. Kolakowska, H. Gu...
INFOCOM
2010
IEEE
15 years 4 months ago
Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks
Abstract--Achieving fast, precise, and scalable fault localization has long been a highly desired feature in all-optical mesh networks. Monitoring tree (m-tree) is an interesting m...
János Tapolcai, Lajos Rónyai, Pin-Ha...
SAC
2011
ACM
14 years 9 months ago
RuleGrowth: mining sequential rules common to several sequences by pattern-growth
Mining sequential rules from large databases is an important topic in data mining fields with wide applications. Most of the relevant studies focused on finding sequential rules a...
Philippe Fournier-Viger, Roger Nkambou, Vincent Sh...
DASFAA
2005
IEEE
106views Database» more  DASFAA 2005»
16 years 22 hour ago
Real Datasets for File-Sharing Peer-to-Peer Systems
The fundamental drawback of unstructured peer-to-peer (P2P) networks is the flooding-based query processing protocol that seriously limits their scalability. As a result, a signiï...
Shen-Tat Goh, Panos Kalnis, Spiridon Bakiras, Kian...
AINA
2004
IEEE
15 years 10 months ago
An Efficient Clustered Architecture for P2P Networks
Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some ...
Juan Li, Son T. Vuong