Sciweavers

977 search results - page 25 / 196
» Permuting Web Graphs
Sort
View
ICWS
2008
IEEE
15 years 1 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
KDD
2001
ACM
262views Data Mining» more  KDD 2001»
16 years 4 days ago
LOGML: Log Markup Language for Web Usage Mining
Web Usage Mining refers to the discovery of interesting information from user navigational behavior as stored in web access logs. While extracting simple information from web logs...
John R. Punin, Mukkai S. Krishnamoorthy, Mohammed ...
CORR
2010
Springer
186views Education» more  CORR 2010»
14 years 12 months ago
Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks
We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...
Paolo Boldi, Marco Rosa, Massimo Santini, Sebastia...
ADBIS
2006
Springer
90views Database» more  ADBIS 2006»
15 years 5 months ago
Finding Communities in Site Web-Graphs and Citation Graphs
The Web is a typical example of a social network. One of the most intriguing features of the Web is its self-organization behavior, which is usually faced through the existence of ...
Antonis Sidiropoulos
SPIRE
2007
Springer
15 years 5 months ago
A Fast and Compact Web Graph Representation
Compressed graphs representation has become an attractive research topic because of its applications to the manipulation of huge Web graphs in main memory. By far the best current ...
Francisco Claude, Gonzalo Navarro