Sciweavers

1092 search results - page 124 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
APVIS
2007
15 years 7 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
157
Voted
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
16 years 9 days ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
162
Voted
ICML
2003
IEEE
15 years 11 months ago
The Influence of Reward on the Speed of Reinforcement Learning: An Analysis of Shaping
Shaping can be an effective method for improving the learning rate in reinforcement systems. Previously, shaping has been heuristically motivated and implemented. We provide a for...
Adam Laud, Gerald DeJong
ACMICEC
2007
ACM
107views ECommerce» more  ACMICEC 2007»
15 years 10 months ago
A family of growth models for representing the price process in online auctions
Bids during an online auction arrive at unequally-spaced discrete time points. Our goal is to capture the entire continuous price-evolution function by representing it as a functi...
Valerie Hyde, Wolfgang Jank, Galit Shmueli
CORR
2011
Springer
158views Education» more  CORR 2011»
15 years 1 months ago
The power and Arnoldi methods in an algebra of circulants
Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each “...
David F. Gleich, Chen Greif, James M. Varah