Sciweavers

174 search results - page 18 / 35
» Efficient Compression of Web Graphs
Sort
View
PVLDB
2010
146views more  PVLDB 2010»
13 years 4 months ago
HaLoop: Efficient Iterative Data Processing on Large Clusters
The growing demand for large-scale data mining and data analysis applications has led both industry and academia to design new types of highly scalable data-intensive computing pl...
Yingyi Bu, Bill Howe, Magdalena Balazinska, Michae...
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 2 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
WWW
2007
ACM
14 years 10 months ago
Mobile shopping assistant: integration of mobile applications and web services
The goal of this poster is to describe our implementation of a new architecture enabling efficient integration between mobile phone applications and Web Services. Using this archi...
Huaigu Wu, Yuri Natchetoi
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 9 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
ICAC
2008
IEEE
14 years 4 months ago
Tailoring Resources: The Energy Efficient Consolidation Strategy Goes Beyond Virtualization
Virtualization and consolidation are two complementary techniques widely adopted in a global strategy to reduce system management complexity. In this paper we show how two simple ...
Jordi Torres, David Carrera, Vicenç Beltran...