Sciweavers

898 search results - page 101 / 180
» A Linear Tabling Mechanism
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
Edith Cohen, Amos Fiat, Haim Kaplan
USENIX
2003
13 years 9 months ago
Operating System I/O Speculation: How Two Invocations Are Faster Than One
We present an in-kernel disk prefetcher which uses speculative execution to determine what data an application is likely to require in the near future. By placing our design withi...
Keir Faser, Fay Chang
CN
2010
95views more  CN 2010»
13 years 8 months ago
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re...
Michael Menth, Matthias Hartmann, Rüdiger Mar...
CAL
2007
13 years 7 months ago
Physical Register Reference Counting
—Several recently proposed techniques including CPR (Checkpoint Processing and Recovery) and NoSQ (No Store Queue) rely on reference counting to manage physical registers. Howeve...
A. Roth
ATAL
2010
Springer
13 years 9 months ago
On the limits of dictatorial classification
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...