Sciweavers

865 search results - page 87 / 173
» Random graph models for the web graph
Sort
View
230
Voted
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
16 years 5 months ago
Query Selection Techniques for Efficient Crawling of Structured Web Sources
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
Ping Wu, Ji-Rong Wen, Huan Liu, Wei-Ying Ma
WWW
2009
ACM
16 years 4 months ago
Graffiti: node labeling in heterogeneous networks
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
Ralitsa Angelova, Gjergji Kasneci, Fabian M. Sucha...
150
Voted
KBSE
2008
IEEE
15 years 10 months ago
An Automated Test Code Generation Method for Web Applications using Activity Oriented Approach
—Automated tests are important for Web applications as they grow more complex day by day. Web application testing frameworks have emerged to help satisfy this need. However, used...
David A. Turner, Moonju Park, Jaehwan Kim, Jinseok...
IJAHUC
2008
118views more  IJAHUC 2008»
15 years 3 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani
CONNECTION
2006
101views more  CONNECTION 2006»
15 years 3 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams