Sciweavers

114 search results - page 22 / 23
» The Covert Set-Cover Problem with Application to Network Dis...
Sort
View
PDIS
1994
IEEE
13 years 9 months ago
Achieving Transaction Scaleup on Unix
Constructing scalable high-performance applications on commodity hardware running the Unix operating system is a problem that must be addressed in several application domains. We ...
Marie-Anne Neimat, Donovan A. Schneider
WWW
2008
ACM
14 years 6 months ago
As we may perceive: finding the boundaries of compound documents on the web
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...
Pavel Dmitriev
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
13 years 10 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
SDM
2009
SIAM
192views Data Mining» more  SDM 2009»
14 years 2 months ago
Mining Cohesive Patterns from Graphs with Feature Vectors.
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
Arash Rafiey, Flavia Moser, Martin Ester, Recep Co...
SIGCOMM
2005
ACM
13 years 11 months ago
Towards a global IP anycast service
IP anycast, with its innate ability to find nearby resources in a robust and efficient fashion, has long been considered an important means of service discovery. The growth of P2...
Hitesh Ballani, Paul Francis