Sciweavers

18306 search results - page 15 / 3662
» Algorithmics in Exponential Time
Sort
View
PODC
2009
ACM
16 years 2 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
DAWAK
2000
Springer
15 years 6 months ago
Mining Frequent Binary Expressions
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
Toon Calders, Jan Paredaens
123
Voted
SIGCOMM
1996
ACM
15 years 6 months ago
Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
Pawan Goyal, Harrick M. Vin, Haichen Cheng
87
Voted
CSREASAM
2006
15 years 3 months ago
Secret Key Leakage Caused by Hamming-weight Timing Analysis on Modular Exponentiation
Mykola Karpinskyy, Lesya Vasylkiv, Marcin Gizycki
FOCS
1990
IEEE
15 years 6 months ago
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
Noga Alon, Nimrod Megiddo