Sciweavers

2200 search results - page 102 / 440
» Bloch's Constant is Computable
Sort
View
RSA
2006
91views more  RSA 2006»
15 years 6 months ago
Average case analysis of the Boyer-Moore algorithm
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
Tsung-Hsi Tsai
CORR
2004
Springer
92views Education» more  CORR 2004»
15 years 6 months ago
Embeddings into the Pancake Interconnection Network
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In ...
Christian Lavault
ORL
2002
78views more  ORL 2002»
15 years 6 months ago
Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D
We derive the waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic (or constant) service times. We show that the procedure for...
Mohan L. Chaudhry, Bong K. Yoon, Kyung C. Chae
MOC
2010
15 years 1 months ago
Discontinuous Galerkin approximations of the Stokes and Navier-Stokes equations
Numerical schemes to compute approximate solutions of the evolutionary Stokes and Navier-Stokes equations are studied. The schemes are discontinuous in time and conforming in space...
Konstantinos Chrysafinos, Noel Walkington
PDP
2011
IEEE
14 years 10 months ago
Transport Optimization in Peer-to-Peer Networks
Abstract—The peer-to-peer networking concept has revolutionized the cost structure of Internet data dissemination by making large scale content delivery with low server cost feas...
Konstantin Miller, Adam Wolisz