Sciweavers

406 search results - page 33 / 82
» Dominating Sets in Web Graphs
Sort
View
JUCS
2002
132views more  JUCS 2002»
13 years 8 months ago
Managing User Focused Access to Distributed Knowledge
: Community web sites exhibit the property that multiple content providers exist. Of course, any portal is only as useful as the quality and amount of its content. Developing origi...
Rudi Studer, York Sure, Raphael Volz
ICPP
2006
IEEE
14 years 3 months ago
A PROactive Request Distribution (PRORD) Using Web Log Mining in a Cluster-Based Web Server
Widely adopted distributor-based systems forward user requests to a balanced set of waiting servers in complete transparency to the users. The policy employed in forwarding reques...
Heung Ki Lee, Gopinath Vageesan, Ki Hwan Yum, Eun ...
PAKDD
2010
ACM
179views Data Mining» more  PAKDD 2010»
14 years 1 months ago
Answer Diversification for Complex Question Answering on the Web
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
Palakorn Achananuparp, Xiaohua Hu, Tingting He, Ch...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 3 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
ECOOP
2006
Springer
14 years 21 days ago
The Runtime Structure of Object Ownership
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...
Nick Mitchell