Sciweavers

2996 search results - page 149 / 600
» Numberings and Randomness
Sort
View
RSA
2006
91views more  RSA 2006»
15 years 5 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
IJKESDP
2010
60views more  IJKESDP 2010»
15 years 4 months ago
Portfolio selection problems with normal mixture distributions including fuzziness
— In this paper, several portfolio selection problems with normal mixture distributions including fuzziness are proposed. Until now, many researchers have proposed portfolio mode...
Takashi Hasuike, Hiroaki Ishii
CPC
2006
93views more  CPC 2006»
15 years 5 months ago
Distribution of Vertex Degree in Web-Graphs
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
Colin Cooper
PROPERTYTESTING
2010
15 years 3 months ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon
IADIS
2003
15 years 6 months ago
Optimizing Web Server's Data Transfer with Hotlinks
We study the optimization of the expected number of bytes that must be transferred by the Web server when a user visits one of its pages. Given a Web site, we want to find an assi...
Evangelos Kranakis, Danny Krizanc, Miguel Vargas M...