Sciweavers

4342 search results - page 631 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
AIRS
2005
Springer
15 years 11 months ago
Calculating Webpage Importance with Site Structure Constraints
PageRank is one of the most popular link analysis algorithms that have shown their effectiveness in web search. However, PageRank only consider hyperlink information. In this paper...
Hui-Min Yan, Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, ...
ICALP
2003
Springer
15 years 10 months ago
Quantum Search on Bounded-Error Inputs
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
Peter Høyer, Michele Mosca, Ronald de Wolf
SPAA
2010
ACM
15 years 10 months ago
Collaborative scoring with dishonest participants
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti R...
ICALP
2010
Springer
15 years 10 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
ISCC
2000
IEEE
104views Communications» more  ISCC 2000»
15 years 9 months ago
Dynamic Routing and Wavelength Assignment Using First Policy Iteration
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
Esa Hyytiä, Jorma T. Virtamo