Sciweavers

160 search results - page 11 / 32
» Towards effective partition management for large graphs
Sort
View
AMKM
2003
Springer
15 years 3 months ago
Towards Agent-Mediated Knowledge Management
Abstract. In this paper, we outline the relation between Knowledge Management (KM) as an application area on the one hand, and software agents as a basic technology for supporting ...
Ludger van Elst, Virginia Dignum, Andreas Abecker
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
13 years 11 days ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 5 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
DAWAK
2006
Springer
15 years 1 months ago
Efficient Mining of Large Maximal Bicliques
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
Guimei Liu, Kelvin Sim, Jinyan Li
ICDCS
2010
IEEE
14 years 12 months ago
Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
Dezun Dong, Yunhao Liu, Kebin Liu, Xiangke Liao