Sciweavers

1964 search results - page 167 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
SIGIR
2012
ACM
11 years 10 months ago
Fighting against web spam: a novel propagation method based on click-through data
Combating Web spam is one of the greatest challenges for Web search engines. State-of-the-art anti-spam techniques focus mainly on detecting varieties of spam strategies, such as ...
Chao Wei, Yiqun Liu, Min Zhang, Shaoping Ma, Liyun...
SPIN
2004
Springer
14 years 1 months ago
Explicit State Model Checking with Hopper
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
Michael Jones, Eric Mercer
ICCAD
2003
IEEE
143views Hardware» more  ICCAD 2003»
14 years 5 months ago
Fractional Cut: Improved Recursive Bisection Placement
In this paper, we present improvements to recursive bisection based placement. In contrast to prior work, our horizontal cut lines are not restricted to row boundaries; this avoid...
Ameya R. Agnihotri, Mehmet Can Yildiz, Ateen Khatk...
ISCI
2010
175views more  ISCI 2010»
13 years 6 months ago
Clustering web people search results using fuzzy ants
Person name queries often bring up web pages that correspond to individuals sharing the same name. The Web People Search (WePS) task consists of organizing search results for ambi...
Els Lefever, Timur Fayruzov, Véronique Host...
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 2 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith