Sciweavers

1541 search results - page 204 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
IWLCS
2001
Springer
14 years 19 days ago
Explorations in LCS Models of Stock Trading
In previous papers we have described the basic elements for building an economic model consisting of a group of artificial traders functioning and adapting in an environment conta...
Sonia Schulenburg, Peter Ross
WG
1993
Springer
14 years 8 days ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
ECCC
2000
93views more  ECCC 2000»
13 years 8 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg
SADM
2008
90views more  SADM 2008»
13 years 7 months ago
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, J&e...
TCOM
2010
65views more  TCOM 2010»
13 years 2 months ago
Max-matching diversity in OFDMA systems
Abstract--This paper considers the problem of optimal subcarrier allocation in OFDMA systems to achieve the minimum outage probability while guaranteeing fairness. The optimal subc...
Bo Bai, Wei Chen, Zhigang Cao, Khaled Ben Letaief