Sciweavers

2944 search results - page 496 / 589
» Improving Bound Propagation
Sort
View
PODC
2005
ACM
15 years 12 months ago
Distance estimation and object location via rings of neighbors
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
Aleksandrs Slivkins
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
15 years 12 months ago
Approximating the Bandwidth of Caterpillars
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
Uriel Feige, Kunal Talwar
COCO
2005
Springer
96views Algorithms» more  COCO 2005»
15 years 12 months ago
A Geometric Approach to Information-Theoretic Private Information Retrieval
A t-private private information retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit string x replicated among k servers, while any coalition of up to t server...
David P. Woodruff, Sergey Yekhanin
FCT
2005
Springer
15 years 12 months ago
Generic Density and Small Span Theorem
We refine the genericity concept of Ambos-Spies, by assigning a real number in [0, 1] to every generic set, called its generic density. We construct sets of generic density any E...
Philippe Moser
HIPEAC
2005
Springer
15 years 12 months ago
Enhancing Network Processor Simulation Speed with Statistical Input Sampling
Abstract. While cycle-accurate simulation tools have been widely used in modeling high-performance processors, such an approach can be hindered by the increasing complexity of the ...
Jia Yu, Jun Yang 0002, Shaojie Chen, Yan Luo, Laxm...