Sciweavers

1434 search results - page 172 / 287
» Graph Searching with Advice
Sort
View
SIGIR
2008
ACM
13 years 8 months ago
Pagerank based clustering of hypertext document collections
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
Konstantin Avrachenkov, Vladimir Dobrynin, Danil N...
TWC
2008
145views more  TWC 2008»
13 years 7 months ago
Generalized Window-Based PN Acquisition Scheme in CDMA Spread Spectrum Systems
In this letter, we propose a generalized version of the window-based pseudonoise (PN) acquisition scheme verifying one or more best hypotheses rather than the best one per search w...
Kwang Man Ok, Chung Gu Kang
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
13 years 7 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
13 years 6 months ago
Parallel shared memory strategies for ant-based optimization algorithms
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Riz...
ICDCS
2007
IEEE
14 years 3 months ago
Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks
In unstructured peer-to-peer (P2P) networks, the overlay topology (or connectivity graph) among peers is a crucial component in addition to the peer/data organization and search. ...
Hasan Guclu, Murat Yuksel