Sciweavers

1254 search results - page 167 / 251
» Making Hard Problems Harder
Sort
View
CLOUD
2010
ACM
14 years 3 months ago
Differential virtual time (DVT): rethinking I/O service differentiation for virtual machines
This paper investigates what it entails to provide I/O service differentiation and performance isolation for virtual machines on individual multicore nodes in cloud platforms. Sh...
Mukil Kesavan, Ada Gavrilovska, Karsten Schwan
PODS
2010
ACM
150views Database» more  PODS 2010»
14 years 3 months ago
Understanding queries in a search database system
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...
PODS
2010
ACM
181views Database» more  PODS 2010»
14 years 3 months ago
Schema design for XML repositories: complexity and tractability
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
Wim Martens, Matthias Niewerth, Thomas Schwentick
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 2 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 2 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