Sciweavers

2252 search results - page 258 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
WWW
2009
ACM
16 years 7 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore
QUESTA
2010
86views more  QUESTA 2010»
15 years 4 months ago
Dynamic admission and service rate control of a queue
This paper investigates a queueing system in which the controller can perform admission and service rate control. In particular, we examine a single server queueing system with Po...
Kranthi Mitra Adusumilli, John J. Hasenbein
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
16 years 1 days ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
ICDCS
1995
IEEE
15 years 10 months ago
A Competitive Analysis for Retransmission Timeout
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
Shlomi Dolev, Michael Kate, Jennifer L. Welch
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
15 years 10 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...