Sciweavers

5105 search results - page 212 / 1021
» An algorithm to determine peer-reviewers
Sort
View
WEBI
2007
Springer
16 years 21 days ago
Experimental Bounds on the Usefulness of Personalized and Topic-Sensitive PageRank
PageRank is an algorithm used by several search engines to rank web documents according to their assumed relevance and popularity deduced from the Web’s link structure. PageRank...
Sinan Al-Saffar, Gregory L. Heileman
DOCENG
2006
ACM
16 years 17 days ago
Minimum sized text containment shapes
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...
Nathan Hurst, Kim Marriott, Peter Moulder
ISCAS
2002
IEEE
108views Hardware» more  ISCAS 2002»
15 years 11 months ago
Optimal adaptive bandwidth monitoring for QoS based retrieval
—Network aware multimedia delivery applications are a class of applications that provide certain level of quality of service (QoS) guarantees to end users while not assuming unde...
Yinzhe Yu, Anup Basu, Irene Cheng
WG
1999
Springer
15 years 10 months ago
Finding Smallest Supertrees Under Minor Containment
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine differences or similarities among trees. One way of meas...
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thi...
FOCS
1997
IEEE
15 years 10 months ago
The Computational Complexity of Knot and Link Problems
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
Joel Hass, J. C. Lagarias, Nicholas Pippenger